From cf705f02b242ae198dcb6a76c404990937feb52e Mon Sep 17 00:00:00 2001 From: lshprung Date: Mon, 18 May 2020 11:28:37 -0700 Subject: Post-class 05/18 --- 05-15.md | 4 ++++ 1 file changed, 4 insertions(+) (limited to '05-15.md') diff --git a/05-15.md b/05-15.md index 9a34c34..61dace5 100644 --- a/05-15.md +++ b/05-15.md @@ -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) -- cgit