Explain how heap sort works.
What will be an ideal response?
First, a maxheap is created on the elements that need to be sorted. Next, the elements are removed, one-by-
one, from the root. The elements will be removed from the heap in descending order, and therefore they can be sorted. To sort
the list in ascending order, a minheap can be used instead.
Computer Science & Information Technology
You might also like to view...
A(n) ________ is a title that is added to a Word object and is numbered sequentially
Fill in the blank(s) with correct word
Computer Science & Information Technology
When making changes, you must remove the access list, using the ____ command.
A. no access-list [list number] B. access-list off [list number] C. off access-list [list number] D. access-list [list number] no
Computer Science & Information Technology