Search results
We did not find results for: define heap sort.
Check spelling or type a new query.
We did not find results for: define heap sort.
Check spelling or type a new query.
In computer science, heapsort is a comparison-based sorting algorithm which can be thought of as "an implementation of selection sort using the right data structure." Like selection sort, heapsort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element from it and inserting it into the sorted region. Wikipedia