Add table with performance of operations

apple · Jul 16, 2021 · 6b5e637 · 6b5e637
1 parent 26d786a
commit 6b5e637
Showing 1 changed file with 10 additions and 0 deletions.
diff --git a/Documentation/Heap.md b/Documentation/Heap.md
@@ -118,6 +118,16 @@ for val in heap.descending {
 
 ### Performance
 
+| Operation | Complexity |
+|-----------|------------|
+| Insert | O(log n) |
+| Get smallest element | O(1) |
+| Get largest element | O(1) |
+| Remove smallest element | O(log n) |
+| Remove largest element | O(log n) |
+
+In all of the above, `n` is the number of elements in the heap.
+
 ## Implementation Details
 
 The implementation is based off [Atkinson et al. Min-Max Heaps and Generalized Priority Queues (1986)](http://akira.ruc.dk/~keld/teaching/algoritmedesign_f03/Artikler/02/Atkinson86.pdf).