Heap Sorting Algorithm

Question

I need the algorithm of HeapSort for sorting the elements of the array, such that all the elements of the array i.e [19 18 14 15 5 7 13 3 8] are in non-decreasing order.

It is okay to ask here, but wikipedia usually has very good articles on algorithms. — R. Martinho Fernandes
– R. Martinho Fernandes, Commented Jan 3, 2010 at 12:17

Prasoon Saurav · Accepted Answer · 2010-01-03 12:49:16Z

4

Read about Heapsort here. A nice pseudocode has also been provided.

edited Jan 3, 2010 at 12:49

answered Jan 3, 2010 at 12:03

Prasoon Saurav

93.3k51 gold badges245 silver badges348 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

R. Martinho Fernandes · Accepted Answer · 2010-01-03 12:25:03Z

1

Heapsort is pretty simple. You grab all elements, put them in a heap (in your case, a max-heap) in any order and then grab them back from the heap (with the delete-max operation) and they come all sorted up.

edited Jan 3, 2010 at 12:25

answered Jan 3, 2010 at 12:18

R. Martinho Fernandes

236k73 gold badges444 silver badges518 bronze badges

Comments

Z0dCHiY8 · Accepted Answer · 2013-02-17 01:46:28Z

0

Actually, you can use IF-free (branchless) heap sort

answered Feb 17, 2013 at 1:46

Z0dCHiY8

11 bronze badge

Collectives™ on Stack Overflow

Heap Sorting Algorithm

3 Answers 3

Comments

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

Comments

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related