<aside> 💡

Topic: Mergesort, Heapsort and Counting-sort.

Deadline: 11/29, 2024

成員： 組別：

</aside>

1. Programming Assignment: Implement MERGE-SORT3 (in Assignment-2).
2. Programming Assignment: Implement HEAPSORT.
3. Use HEAPSORT to sort $A=[4, 6, 9, 2, 8, 1, 7, 3, 5]$. Show the actions step by step. You have to mention the name of the functions used, e.g., MAX-HEAPIFY(A, i), BUILD-MAX-HEAP(A)…
4. Using Example(*) in Topic 6 as a model, illustrate the operation of COUNTING-SORT on the array $A = [6, 0, 2, 0, 1, 3, 4, 6, 1, 3, 2]$.