tiagogottardo / ds-process Goto Github PK

void insertMaxHeap(MaxHeap *heap, Node *new) {
  if (heap && heap->vector) {

    if (!heap->index) {
      heap->vector->priority = new->priority;
      heap->index++;
      return;
    }

    if (heap->index == heap->capacity) {
      Node *vet = realloc(heap->vector, heap->capacity * 2);

      if (vet) {
        heap->vector = vet;
      } else {
        printf("Heap is full! It could not possible insert anymore.\n");
        return;
      }
    }

    heap->index++;
    int i = heap->index;
    heap->vector[i].priority = new->priority;
    int parent = i / 2;

    while (i > 1 && heap->vector[i].priority > heap->vector[parent].priority) {
      swap(&heap->vector[i], &heap->vector[parent]);
      i = parent;
      parent = i / 2;
    }
  }
}