heap.definition

// Java
class MaxHeap {
    int[] heap = new int[31];
    int size = 0;

    void insert(int value) {
        heap[size] = value;
        int i = size++;
        // Bubble up
        while (i > 0 && heap[i] > heap[(i-1)/2]) {
            swap(i, (i-1)/2);
            i = (i-1)/2;
        }
    }
}

# Python
class MaxHeap:
    def __init__(self):
        self.heap = []

    def insert(self, value):
        self.heap.append(value)
        i = len(self.heap) - 1
        # Bubble up
        while i > 0 and self.heap[i] > self.heap[(i-1)//2]:
            parent = (i-1)//2
            self.heap[i], self.heap[parent] = \
                self.heap[parent], self.heap[i]
            i = parent

// C++
class MaxHeap {
    vector<int> heap;
public:
    void insert(int value) {
        heap.push_back(value);
        int i = heap.size() - 1;
        // Bubble up
        while (i > 0 && heap[i] > heap[(i-1)/2]) {
            swap(heap[i], heap[(i-1)/2]);
            i = (i-1)/2;
        }
    }
};

// JavaScript
class MaxHeap {
  constructor() { this.heap = []; }

  insert(value) {
    this.heap.push(value);
    let i = this.heap.length - 1;
    // Bubble up
    while (i > 0 && this.heap[i] > this.heap[Math.floor((i-1)/2)]) {
      const parent = Math.floor((i-1)/2);
      [this.heap[i], this.heap[parent]] =
        [this.heap[parent], this.heap[i]];
      i = parent;
    }
  }
}