User:Andre.holzner/sandbox

{{include timeline}}

Hash table
Type	Unordered associative array
Invented	1953
Time complexity in big O notation
	Average	Worst case
Space	O(n)
Search
Insert
Delete
Find-min	O(1)

{{Infobox testinfobox |name=Hash table |type=Unordered [[associative array]] |invented_by= |invented_year=1953 |space_avg=O(''n'') |space_worst= |search_avg= |search_worst= |insert_avg= |insert_worst= |delete_avg= |delete_worst= |find_min_avg=O(1) |find_min_worst= }}

User:Andre.holzner/Infobox_testinfobox

standard data structure template
Type	Unordered associative array
Time complexity in big O notation Operation Average Worst case Peek 1   Space complexity Space O(n)

Binary Heap
Type	tree
Time complexity in big O notation Operation Average Worst case Search O(n) O(n) Insert O(1) O(log n) Delete O(log n) O(log n) Peek O(1) O(1) Find-min O(1)   Space complexity Space O(n) O(n)