Search data structure: Difference between revisions

Revision as of 21:31, 28 June 2011

Revision as of 03:33, 21 September 2011

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."

Line 102:

== See also ==

* [[List of data structures]]

{{datastructure-stub}}

[[Category:Data structures]]