Searching and sorting

Binary search finds an item in a sorted list by halving it each step: 1 million items takes about 20 checks. Merge sort and quicksort sort in O(n log n). You'll rarely write a sort yourself, but you should know what .sort() costs and that JavaScript's default sort compares numbers as text.