browse/
4 results
computer-science/binary-search-trees-why-the-order-you-insert-numbers-changes-how-fast.md
Binary search trees: why the order you insert numbers changes how fast you can find them
A binary search tree keeps numbers in order with one rule: smaller goes left, bigger goes right. Build one yourself, watch a search light…
databases/sql-indexes-why-finding-one-row-among-200-000-takes-about-18-steps.md
SQL indexes: why finding one row among 200,000 takes about 18 steps
A database with 200,000 customers can answer "find this email" by reading every row, or by reading about 18 entries. The difference is an…
computer-science/binary-search-how-to-find-one-number-in-a-million-with-20-guesses.md
Binary search: how to find one number in a million with 20 guesses
Guessing a number between 1 and 1,000,000 sounds like it could take a million tries. With binary search it takes at most 20. Step through a…
computer-science/linear-vs-binary-search-why-30-guesses-can-beat-a-billion.md
Linear vs binary search: why 30 guesses can beat a billion
Need to find one item in a list? You can check every item in turn (linear search), or, if the list is sorted, look at the middle and throw…