Diff for "TimeComplexity"

Differences between revisions 2 and 3

Some common O() notations about TimeComplexity

BigOhNotation	meaning	example
O(1)	constant	access element in array
O(log(n))	logarithmic	BinarySearch
O(n)	linear	sequential search
O(n log(n))	worse than linear, but not much worse	QuickSort, HeapSort
O(n²)	squar law	selection and InsertionSort
O(n³)	cubic	ultiplication of 2 n * n
O(Cⁿ)	exponential	TravelingSalesmanProblem , SetPartitioning

⇤ ← Revision 2 as of 2005-12-16 15:43:00 → Size: 593 Editor: 211 Comment:	← Revision 3 as of 2011-08-03 11:00:42 → ⇥ Size: 593 Editor: localhost Comment: converted to 1.6 markup
No differences found!