AlgoFlow — Algorithms, Visualized

heappriority-queuecomplete-tree

Press play to start

1void insert(int heap[], int *size, int val) {
  heap[(*size)++] = val;
  int i = *size - 1;
  while (i > 0 && heap[i] < heap[(i - 1) / 2]) {
      int t = heap[i]; heap[i] = heap[(i-1)/2]; heap[(i-1)/2] = t;
      i = (i - 1) / 2;
  }
8}

Step 1/0

Practice

LeetCode·#215 Kth Largest ElementMedium HackerRank·Jesse and CookiesEasy

Operation	Best	Average	Worst
insert	O(log n)	O(log n)	O(log n)
extract min	O(log n)	O(log n)	O(log n)
get min	O(1)	O(1)	O(1)
heapify	O(n)	O(n)	O(n)

SpaceO(n)