Revision #26 → #1008 · back to history
addedAnalysis of algorithmsa3c9863686f8
addedEfficient algorithm9de3368478fa
addedBinary search runs in logarithmic time5610197455ed
addedHidden constant2afec38dcb4a
addedModel of computationf85ba0cbbb19
addedBinary search time bound on n elementsf995000bd4ac
addedUniform cost model679b58982771
addedLogarithmic cost modelc60d9d36d424
addedRun-time analysisdef423953df1
addedLinear vs binary search on two computers53321452b672
addedOrder of growth (Big O)beeb10422f5c
addedInsertion sort is O(n^2)354365952999
addedQuicksort average-case O(n log n)8f56f81bb95d
addedPower rule for empirical order of growthd0d8755a9918
addedAlgorithm run-time is O(n^2)6fc36527e29a
addedExponential memory consumption O(2^n)8498b83fdd6c
addedAll practical algorithms are O(1) for large enough constant07f44f7d52cf
addedHybrid algorithm Timsortba6feef353b1