diff options
Diffstat (limited to '05-15.md')
| -rw-r--r-- | 05-15.md | 4 |
1 files changed, 4 insertions, 0 deletions
@@ -97,3 +97,7 @@ binary heaps work because of **no holes**, and are a great example of an implici - Generally speaking, a heap can be used whenever you need **quick access** to the largest (or smallest) item, because that item will always be the first element in the array or at the root of the tree - It's not good for searching, since the remainder of the array is kept partially unsorted - Some examples of heap: priority queue, Huffman coding, heap sort, etc. + +--- + +[05/18 ->](05-18.md) |