Searching Unstructured Data

If you have an unsorted database of $N$ items, classical search takes $O(N)$ time. Grover's algorithm takes $O(√N)$ time. This is a quadratic speedup.