| 60000 | n log^2^ n, n^1.585^ | divide and conquer, Karatsuba | 2d range trees |
| 100000 | n log n | divide and conquer, sweep line, Kruskal, Dijkstra | segment trees, range trees, heaps, treaps, binary indexed trees, suffix arrays |
| 1000000 | 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 |

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

| 1000000000 | log(n), sqrt(n) | binary search, ternary search, fast exponentiation, euclid algorithm |   |