Binary vs Linear searches for unsorted N elements

Question

I try to understand a formula when we should use quicksort. For instance, we have an array with N = 1_000_000 elements. If we will search only once, we sho

Answer 1

You should plot the complexities of both operations.

Linear search: O(n)

Sort and binary search: O(nlogn + logn)

In the plot, you will see for which values of n it makes sense to choose the one approach over the other.