static void heapSort(MyFileList arr, int n)
{
for (int i = n / 2 - 1; i >= 0; i--)
{
heapify(arr, n, i);
}
for (int i = n - 1; i >= 0; i--)
{
arr.Swap(0, arr.Get(0), i, arr.Get(i));
heapify(arr, i, 0);
}
}
static void heapify(MyFileList arr, int n, int i)
{
int largest = i;
int left = 2 * i + 1;
int right = 2 * i + 2;
if (left < n && arr.Get(left).CompareTo(arr.Get(largest)) > 0)
{
largest = left;
}
if (right < n && arr.Get(right).CompareTo(arr.Get(largest)) > 0)
{
largest = right;
}
if (largest != i)
{
arr.Swap(i, arr.Get(i), largest, arr.Get(largest));
heapify(arr, n, largest);
}
}
public static void Test_File_Array_List_heap(int seed)
{
int n = 5000;
string filename;
filename = @"mydatalist.dat";
MyFileList heapFileList = new MyFileList(filename, n, seed);
using (heapFileList.fs = new FileStream(filename, FileMode.Open,
FileAccess.ReadWrite))
{
Console.WriteLine("\n HEAP FILE LIST \n");
// heapFileList.Print(n);
var time = System.Diagnostics.Stopwatch.StartNew();
heapSort(heapFileList, n);
//heapFileList.Print(n);
time.Stop();
Console.WriteLine("Uztruko: {0}ms", time.Elapsed.TotalMilliseconds);
}
}
