Content deleted Content added
deleting suspicious data from the infobox; please see Talk:Binary heap#O(log n) for decrease-key is misleading Tag: Reverted |
Undid revision 1271070941 by CiaPan (talk) O(log n) decrease-key isn't misleading; otherwise, is O(1) decrease-key for Fibonacci heaps misleading too? See talk page reply :) |
||
Line 15:
|delete_min_avg=O(log ''n'')
|delete_min_worst=O(log ''n'')
|decrease_key_avg=O(log ''n'')
|decrease_key_worst=O(log ''n'')
|find_min_avg=O(1)
|find_min_worst=O(1)
| |||