From 8e49abd24a092e406f713e1ca94a63c8b30a42ae Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Fri, 11 Apr 2025 11:19:25 -0400 Subject: [PATCH] adding heap sort animation --- lectures/24_priority_queues_II/README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/lectures/24_priority_queues_II/README.md b/lectures/24_priority_queues_II/README.md index 4d81b9d..b6bec33 100644 --- a/lectures/24_priority_queues_II/README.md +++ b/lectures/24_priority_queues_II/README.md @@ -209,6 +209,8 @@ Sorted array: 12 42 13 65 90 45 97 85 76 98 ``` +- Play this [animation](https://jidongxiao.github.io/CSCI1200-DataStructures/animations/heap/sort/index.html) to see how the push works. + ## 24.9 Summary Notes about Vector-Based Priority Queues - Priority queues are conceptually similar to queues, but the order in which values / entries are removed (“popped”) depends on a priority.