Adding computing time (O(log n)) in help text.

2016-12-13 16:09:28 +01:00 · 2016-12-13 16:09:28 +01:00 · 4338456f9c
commit 4338456f9c
parent c3dda1f0dd
1 changed files with 2 additions and 0 deletions
--- a/data_structures/heaps/Heap.java
+++ b/data_structures/heaps/Heap.java
@ -8,6 +8,8 @@ package heaps;
 * indicate how the tree shall be built. For instance, for a min-heap, the key of a node shall
 * be greater than or equal to its parent's and lower than or equal to its children's (the opposite rule applies to a
 * max-heap).</p>
+ * <p>All heap-related operations (inserting or deleting an element, extracting the min or max) are performed in
+ * O(log n) time.</p>
 * @author Nicolas Renard
 * 
 *