Which is faster, simple search or sort + search?

Question

Algorithms

Good afternoon. Which is faster, simple search or quick sort + binary search? What is the rationale for this?

Answer 1

Simple search
complexity -n Binary search complexity - Log(n)
But the speed of quicksort is non-constant, and in the worst case is n^2.
So there is no definite answer. Everything depends on the input data.
However, if the search is done frequently, and the data does not change (i.e., it can be sorted once), then binary search is definitely faster.
It's all based on mathematics and nothing else.

Answer 2

Linear search - N
qsort - NlogN
Binary search logN
For one-time search - linear search wins