heap

void dyHeapRemoveMin(DynamicArray* heap, compareFunction compare)
{
    // FIXME: implement
    int last = dySize(heap)-1;
    assert (last != 0); /* make sure we have at least one element */
    /* Copy the last element to the first position */
    dyPut(heap, dyGet(heap, last), 0);
    dyRemoveAt(heap, last); /* Remove last element.*/
    adjustHeap(heap, last, 0, compare);/* Rebuild heap */
}

/**
 * Returns the first element, which has the min priority, from the heap.
 * @param heap
 * @return  Element at the top of the heap.
 */
TYPE dyHeapGetMin(DynamicArray* heap)
{
    // FIXME: implement
    return heap->data[0];
}

int indexSmallest = compare(dyGet(heap, leftIdx), dyGet(heap, rightIdx)) == -1 ? leftIdx : rightIdx;

int indexSmallest (DynamicArray *v, int i, int j, compareFunction compare)
{
if(compare(dyGet(v,i), dyGet(v, j)) <=0)
{
return i;
}
else return j;
}

assert(heap != 0); int last; assert(dySize(heap) > 0); last = dySize(heap)-1; dyPut(heap, dyGet(heap,last), 0); dyRemoveAt(heap, last); adjustHeap(heap, last, 0, compare);

if(dySize(list) >0)
{
printf("Printing list...\n");
listPrint(list);
}
else
{
printf("List is empty");
}
break;