'Elementary sorting methods' presentation slideshows

Elementary Sorting Algorithms

351 views • 19 slides

Heap Sort

Heap Sort. The idea : build a heap containing the elements to be sorted, then remove them in order. Let n be the size of the heap, and m be the number of elements to be sorted. The following two steps implement heap sort: Step1 : Construct the heap by doing m insertItem operations.

448 views • 5 slides