public void MoveToDown(int index)
{
int largerChild;
HeapDugumu top = heapArray[index];
while (index < currentSize / 2)
{
int leftChild = 2 * index + 1;
int rightChild = leftChild + 1;
//Find larger child
if (rightChild < currentSize && heapArray[leftChild].UygunlukDegeri < heapArray[rightChild].UygunlukDegeri)
{
largerChild = rightChild;
}
else
{
largerChild = leftChild;
}
if (top.UygunlukDegeri >= heapArray[largerChild].UygunlukDegeri)
{
break;
}
heapArray[index] = heapArray[largerChild];
index = largerChild;
}
heapArray[index] = top;
}
public HeapDugumu RemoveMax() // Remove maximum value HeapDugumu
{
HeapDugumu root = heapArray[0];
heapArray[0] = heapArray[--currentSize];
MoveToDown(0);
heapArray[currentSize] = null;
return(root);
}
public bool Insert(Kisi value)
{
if (currentSize == maxSize)
{
return(false);
}
HeapDugumu newHeapDugumu = new HeapDugumu(value);
heapArray[currentSize] = newHeapDugumu;
MoveToUp(currentSize++);
return(true);
}
public void MoveToUp(int index)
{
int parent = (index - 1) / 2;
HeapDugumu bottom = heapArray[index];
while (index > 0 && heapArray[parent].UygunlukDegeri < bottom.UygunlukDegeri)
{
heapArray[index] = heapArray[parent];
index = parent;
parent = (parent - 1) / 2;
}
heapArray[index] = bottom;
}