Unsorted Lists vs Linear and Binary Search
Alternative 1 of course, since that only requires you to go through the list once. If you are to sort the list, you have to traverse the list at least once for the sorting, and then some for the search.
Hey guys so I've been studying for an upcoming test and I came across this question:

If you had an unsorted list of one million unique items, and knew that you would only search it once for a value, which of the following algorithms would be the fastest?

Use linear search on the unsorted list
Use insertion sort to sort the list and then binary search on the sorted list


Wouldn't the second choice be the fastest? Sorting the list and then looking for the value than only using linear search?