You want to build a function to retrieve a value from a sequential list of unordered elements.
What would be the best approach?
What would be the best approach?
You can assume that the size of the list is unknown.
https://twitter.com/BaranCodes/status/1377998784488148996?s=20
Oh, sorry if this was confusing.
By "sequential list" I meant that elements come one after the other in memory. Think of a regular array.
It doesn't mean that you can't access elements out of order.
By "sequential list" I meant that elements come one after the other in memory. Think of a regular array.
It doesn't mean that you can't access elements out of order.
https://twitter.com/ali__hephaestus/status/1378002050974367750?s=20
The correct answer is "it depends."
1. If we are searching for an element a single time, nothing will beat a sequential search.
2. If we need to use this function multiple times, it's best to sort the list once and then do a binary search over and over again.
1. If we are searching for an element a single time, nothing will beat a sequential search.
2. If we need to use this function multiple times, it's best to sort the list once and then do a binary search over and over again.
• • •
Missing some Tweet in this thread? You can try to
force a refresh
