Jump to content

Template:Infobox data structure-amortized

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jochem van Hees (talk | contribs) at 14:05, 18 January 2021 (Separated time and space complexity (see talk page)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Side by side comparison
{{Infobox data structure-amortized}}{{Infobox data structure-amortized/sandbox}}
"name "
Type"type "
Invented"invented_year "
Invented by"invented_by "
Computational complexity in big O notation
Algorithm Average Worst Case
Time complexity
Search "search_avg " "search_worst "
Insert "insert_avg " "insert_worst "
Delete "delete_avg " "delete_worst "
Peek "peek_avg " "peek_worst "
Find-min "find_min_avg " "find_min_worst "
Delete-min "delete_min_avg " "delete_min_worst "
Decrease-key "decrease_key_avg " "decrease_key_worst "
Merge "merge_avg " "merge_worst "
Space complexity
Space "space_avg " "space_worst "
"name "
Type"type "
Invented"invented_year "
Invented by"invented_by "
Complexities in big O notation
Space complexity
Space "space_avg " "space_worst "
Time complexity
Function Amortized Worst Case
Search "search_avg " "search_worst "
Insert "insert_avg " "insert_worst "
Delete "delete_avg " "delete_worst "
Peek "peek_avg " "peek_worst "
Find-min "find_min_avg " "find_min_worst "
Delete-min "delete_min_avg " "delete_min_worst "
Decrease-key "decrease_key_avg " "decrease_key_worst "
Merge "merge_avg " "merge_worst "