| 100,000 | n log^2^ n| divide and conquer | 2d range trees |
| 1,000,000 | n log n | sorting, divide and conquer, sweep line, Kruskal, Dijkstra | segment trees, range trees, heaps, treaps, binary indexed trees, suffix arrays |
| 10,000,000 | n, n log log n, n log* n | set intersection, Eratosthenes sieve, radix sort, KMP, topological sort, Euler tour, strongly connected components, 2sat | disjoint sets, tries, hash_map, 'rolling hash':blog/rolling-hash |

| 1,000,000,000 | log n, sqrt n | binary search, ternary search, fast exponentiation, euclid algorithm |   |
 
There are a few caveats, these numbers aren't very precise, they assume in memory operations and some varying constant factors. But they do give a good starting point in searching for an algorithm that fits your problem and your data well.

| 1,000,000,000 | log n, sqrt n | binary search, ternary search, fast exponentiation, euclid algorithm |   |