Revision as of 00:06, 11 October 2010 edit 199.33.32.40 (talk) →Asymptotic worst-case analysis ← Previous edit		Revision as of 00:11, 11 October 2010 edit undo 199.33.32.40 (talk) →Asymptotic worst-case analysis Next edit →
Line 23: *[[Heap (data structure)\|Heap]] ====Asymptotic [[Amortized analysis\|amortized]] worst-case analysis==== In this table, the [[asymptotic analysis\|asymptotic]] [[big-O notation\|notation O(''f''(''n''))]] means "not exceeding some fixed multiple of ''f''(''n'')" in the worst case".

Search data structure: Difference between revisions