public class Heap() {


  private int[] elements;

  private bubbleDown(int i) {

    boolean done = false;

    while (!done && i <= elements.length/2) {

      int minindex = finMinChildIndex(i);
      if (elements[i] > elements[minindex]) {
        int temp = elements[minindex];
        elements[minindex] = elements[i];
        elements[i] = temp;
        i = minindex;
      }
      else
        done = true;
    }

  }

  private findMinChildIndex(int i) {
    if (elements[2*i] < elements[2*i+1])
      return 2*i;
    else
      return 2*i+1;
  }

}