Linear Search or QuickSort + Binary Search for an unsorted array?
>>62260429
O(N) < O(NlogN + logN)
but I am hsf right now
>>62260429
bubblesort or bust
>>62260429
depends on the order of complexity, how many operations do you guess?
>>62260429
Depends on what you're doing. Will you be adding new data often? If so, Linear Search is probably the way to go. If not, QuickSort + Binary Search may yield faster results. Just profile it ffs.
>>62260429
too vague. downvoted
>>62260429
Hash map unless you really can't afford asymptotic or probabilistic performance.