Jump to content

User:Andre.holzner/Infobox testinfobox

From Wikipedia, the free encyclopedia
{{{name}}}
Type {{{type}}}
Time complexity
in big O notation
Average Worst case
Space
Search
Insert
Delete


{{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= }}