Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
Nicolas Renard 2016-12-13 16:09:28 +01:00
parent c3dda1f0dd
commit 4338456f9c
1 changed files with 2 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
data_structures/heaps/Heap.java
View File

@ -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 * 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 * 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> * 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 * @author Nicolas Renard
* *
* *