HEAPSORT

Heapsort

Heapsort is a comparison-based sorting algorithm to create a sorted array, and is part of the selection sort family. Although somewhat slower in practice on most machines than a well-implemented quicksort, it has the advantage of a more favorable worst-case O runtime. Heapsort is an in-place algorithm, but it is not a stable sort. It was invented by J. W. J. Williams in 1964.

The above text is a snippet from Wikipedia: Heapsort
and as such is available under the Creative Commons Attribution/Share-Alike License.

heapsort

Noun

  1. A sorting algorithm based on the heap data structure.

Verb

  1. To sort with such an algorithm.


The above text is a snippet from Wiktionary: heapsort
and as such is available under the Creative Commons Attribution/Share-Alike License.

Need help with a clue?
Try your search in the crossword dictionary!