MHB How can we implement this sort?

[mathmari]

Hey!

Consider the following sorting method.

Start with a sequence consisting of one element. Insert the remaining elements into the sequence one at a ime by binary search. Devise a data structure which allow you to perform binary search and insert elements quickly.

How can we implement this sort in $O(n \log n)$ time?? (Wondering)

 

[PvsNP]

Hey!

Consider the following sorting method.

Start with a sequence consisting of one element. Insert the remaining elements into the sequence one at a ime by binary search. Devise a data structure which allow you to perform binary search and insert elements quickly.

How can we implement this sort in $O(n \log n)$ time?? (Wondering)

This is known as the "heapsort" sorting method: Heapsort - Wikipedia, the free encyclopedia

Data structure involved is a tree.