Search data structure: Difference between revisions

Content deleted Content added
Added efficiency data for stacks and queues
m Asymptotic worst-case analysis: there is nothing "amortized" here
Line 23:
*[[Heap (data structure)|Heap]]
 
==Asymptotic 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."