In place heap sorting in java code?

Question

I am trying some heapsorting in java for fun.

First, I create a max-heap. Then take the first element to variable max, move the last item from unarranged array to the heap top, and then push down.

I tried 21 elements, it works fine 70% of time, I am wondering whether anyone find the problem.

Thanks.

public class HeapSort extends Sort{
    public int sort(int arr[]) {
        for (int i = 1; i < arr.length; i++) {
            // add to heap
            int p = i;
            int pp = p /2 ;
            while (p > 0 && arr[pp] < arr[p]) {
                swap(arr, p, pp);
                p = pp;
                pp = p / 2;
            }

        }   

        for (int i = arr.length - 1; i > 0; i--) {
            swap(arr, 0, i);
            int p = 0;
            int child1 = (p << 1) + 1;
            int child2 = (p << 1) + 2;

            while (child2 < i || child1 < i) {
                if (child1 >= i) {
                    if (arr[p] < arr[child2]) {
                        swap(arr, p, child2);
                        p = child2;
                    } else { 
                        break;
                    }
                } else if (child2 >= i) {
                    if (arr[p] < arr[child1]) {
                        swap(arr, p, child1);
                        p = child1;
                    } else {
                        break;
                    }
                } else {
                    int minIdx = arr[child1] < arr[child2] ? child1 : child2;
                    int maxIdx = child1 == minIdx ? child2 : child1;

                    if (arr[p] < arr[maxIdx]) {
                        swap(arr, p, maxIdx);
                        p = maxIdx;
                    } else {

                        break;

                    }
                }
                child1 = (p << 1) + 1;
                child2 = (p << 1) + 2;
            }

        }
        return 0;

    }
    void swap(int arr[], int idx1, int idx2) {
        int tmp = arr[idx1]; arr[idx1] = arr[idx2]; arr[idx2] = tmp;
    }
    public String toString() {
        return "HeapSort";
    }

}

I think codereview.stackexchange.com is more suitable for question like this. — Rangi Lin
– Rangi Lin, Commented Oct 25, 2012 at 4:01

Robert Richter · Accepted Answer · 2012-10-25 03:52:27Z

2

You're not building the heap correctly in the first step of heap-sort. You need to subtract one before dividing by two on zero based arrays.

public class HeapSort extends Sort{ 
   public int sort(int arr[]) { 
      for (int i = 1; i < arr.length; i++) { // add to heap 
         int p = i;
         // int pp = p /2 ;  <======= Problem!
         int pp = (p-1) / 2; 
         while (p > 0 && arr[pp] < arr[p]) { 
            swap(arr, p, pp); p = pp; 
            //  pp = p / 2; // <=====Problem!
            pp = (p-1) /2;

}

answered Oct 25, 2012 at 3:52

Robert Richter

2782 silver badges10 bronze badges

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

2 Comments

Robert Richter Over a year ago

The building of the heap is more efficient if you start at the bottom and use the same routine for rebuilding that you use in phase 2--at each position, treat that position as the top of the heap and use the same code you use for rebuilding in the second stage.

BlueDolphin Over a year ago

Thanks Robert for both solution and the building suggestion!

Collectives™ on Stack Overflow

In place heap sorting in java code?

1 Answer 1

2 Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

2 Comments

Your Answer

Sign up or log in

Post as a guest

Related