From e41e5e4a0c10f9866b8d001946e40bc190519e61 Mon Sep 17 00:00:00 2001 From: Jidong Xiao Date: Tue, 8 Apr 2025 21:54:39 -0400 Subject: [PATCH] list others as variations --- lectures/24_priority_queues_II/README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/lectures/24_priority_queues_II/README.md b/lectures/24_priority_queues_II/README.md index 1ae121c..4d81b9d 100644 --- a/lectures/24_priority_queues_II/README.md +++ b/lectures/24_priority_queues_II/README.md @@ -217,8 +217,10 @@ Sorted array: ## 24.10 Leetcode Exercises +In addition to the above solution, there are also other variations of the heap sort: + - [Leetcode problem 912: Sort an Array](https://leetcode.com/problems/sort-an-array/). - Solution: [p912_heapsort_array.cpp](../../leetcode/p912_heapsort_array.cpp). - - Solution 2: [p912_heapsort_array_heapify.cpp](../../leetcode/p912_heapsort_array_heapify.cpp). + - Solution 2: - max heap: [p912_heapsort_array_heapify.cpp](../../leetcode/p912_heapsort_array_heapify.cpp). - Solution 3: - min heap: [p912_heapsort_array_min_heap.cpp](../../leetcode/p912_heapsort_array_min_heap.cpp). - Solution 4: - min heap, with functor: [p912_heapsort_array_functor.cpp](../../leetcode/p912_heapsort_array_functor.cpp).