Timeline for "For small values of n, O(n) can be treated as if it's O(1)"

3 events

when toggle format	what		by	license	comment
Dec 16, 2014 at 22:56	comment	added	Pseudonym♦		But it also illustrates an important feature of many real-world systems: the "algorithms" that you learn as an undergraduate are actually pieces from which real "algorithms" are made. This is usually hinted at; for example, most people know that quicksort is often written to fall back to insertion sort when the partitions get small enough, and that binary search is often written to fall back to linear search. But not many people realise that merge sort can benefit from some binary search.
Dec 16, 2014 at 22:45	review	First posts
Dec 16, 2014 at 23:31
Dec 16, 2014 at 22:42	history	answered	Pieter B	CC BY-SA 3.0