descending heap sort

Posted by user1 on Stack Overflow See other posts from Stack Overflow or by user1
Published on 2010-06-01T04:22:49Z Indexed on 2010/06/01 4:33 UTC
Read the original article Hit count: 192

Filed under:

heapsort

use heap sort to sort this in descending order and show the steps or explanation please below is the tree

                             79
                       33           57
                    8     25    48

below is the array 79 - 33 - 57 - 8 - 25 - 48 ok ascending is easy because the largest element is at the top we can exchange the last element and the first element and then use heapify as the sample code in wikipedia describes it.

Related posts about heapsort

OS X contains heapsort in stdlib.h which conflicts with heapsort in sort library

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm using Ariel Faigon's sort library, found here: http://www.yendor.com/programming/sort/ I was able to get all my code working on Linux, but unfortunately, when trying to compile with GCC on Mac, its default stdlib.h contains another heapsort, which unfortunately results in a conflicting types… >>> More
Heapsort not working in Python for list of strings using heapq module

as seen on Stack Overflow - Search for 'Stack Overflow'
I was reading the python 2.7 documentation when I came across the heapq module. I was interested in the heapify() and the heappop() methods. So, I decided to write a simple heapsort program for integers: from heapq import heapify, heappop user_input = raw_input("Enter numbers to be sorted: ") data… >>> More
(1 2 3 . #<void>)- heapsort

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello everybody: I tried to implement a "pairing heap" with all the regular operations (merge, delete-min etc.), then I've been requested to write a function that would sort a list using my newly constructed heap implementation. Unfortunately it seems that someting goes wrong... Here's the relevant… >>> More
Quicksort Vs Heapsort

as seen on Stack Overflow - Search for 'Stack Overflow'
Both do in place sorting.Which is better:quicksort or heap sort? What are the applications/cases in which either of them is preferred? >>> More
Efficient heaps in purely functional languages

as seen on Stack Overflow - Search for 'Stack Overflow'
As an exercise in Haskell, I'm trying to implement heapsort. The heap is usually implemented as an array in imperative languages, but this would be hugely inefficient in purely functional languages. So I've looked at binary heaps, but everything I found so far describes them from an imperative viewpoint… >>> More

Developer IT

descending heap sort - Developer IT

descending heap sort

heapsort

Related posts about heapsort

OS X contains heapsort in stdlib.h which conflicts with heapsort in sort library

Heapsort not working in Python for list of strings using heapq module

(1 2 3 . #<void>)- heapsort

Quicksort Vs Heapsort

Efficient heaps in purely functional languages

Categories cloud