Saved Bookmarks
| 1. |
Explain What Is Heap Sort? |
|
Answer» Heap-sort can be defined as a comparison based SORTING algorithm. It divides its input into the unsorted and sorted region, until it SHRINKS the unsorted region by ELIMINATING the smallest element and moving that to the sorted region. Heap-sort can be defined as a comparison based sorting algorithm. It divides its input into the unsorted and sorted region, until it shrinks the unsorted region by eliminating the smallest element and moving that to the sorted region. |
|