From a170997eafc15733baa70a858600a47c34daacf2 Mon Sep 17 00:00:00 2001 From: jfeng43 Date: Fri, 19 Apr 2019 11:31:06 -0400 Subject: [PATCH] Add animation for heap sort --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index 7cf1f4f64..faebd3135 100644 --- a/README.md +++ b/README.md @@ -89,6 +89,7 @@ __Properties__ ### Heap +![alt text][heapsort-image] **Heapsort** is a _comparison-based_ sorting algorithm. It can be thought of as an improved selection sort. It divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region. @@ -311,6 +312,7 @@ where {\displaystyle \oplus } \oplus denotes the exclusive disjunction (XOR) op [quick-wiki]: https://en.wikipedia.org/wiki/Quicksort [quick-image]: https://upload.wikimedia.org/wikipedia/commons/6/6a/Sorting_quicksort_anim.gif "Quick Sort" +[heapsort-image]: https://upload.wikimedia.org/wikipedia/commons/4/4d/Heapsort-example.gif "Heap Sort" [heap-wiki]: https://en.wikipedia.org/wiki/Heapsort [radix-wiki]: https://en.wikipedia.org/wiki/Radix_sort