//-----------------------------------------------------
//Masyvo rikiavimas
private static DataArray MergeSort(DataArray unsorted) // kaina | kartai
{
if (unsorted.Length <= 1)
{
return(unsorted); // c1 | 1
}
DataArray left;
DataArray right;
if (unsorted.GetType() == typeof(MyDataArray))
{
left = new MyDataArray(unsorted.Length / 2); // c2 | 1
right = new MyDataArray(unsorted.Length / 2 + 1); // c2 | 1
}
else
{
left = new MyFileArray(unsorted.Length / 2); // c2 | 1
right = new MyFileArray(unsorted.Length / 2 + 1); // c2 | 1
}
int middle = unsorted.Length / 2; // c3 | 1
for (int i = 0; i < middle; i++) //Dividing the unsorted list
{
left.Add(unsorted[i]);
}
for (int i = middle; i < unsorted.Length; i++)
{
right.Add(unsorted[i]);
}
left = MergeSort(left);
right = MergeSort(right);
return(Merge(left, right));
}
private static DataArray Merge(DataArray left, DataArray right)
{
DataArray result;
if (right.GetType() == typeof(MyDataArray))
{
result = new MyDataArray(left.Length + right.Length);
}
else
{
result = new MyFileArray(left.Length + right.Length);
}
while (left.Length > 0 || right.Length > 0)
{
if (left.Length > 0 && right.Length > 0)
{
if (left.First() <= right.First()) //lyginam pirmus elementus
{
result.Add(left.First()); //idedam pirma
left.RemoveFirst(); //pasalinam is kairio pirma
}
else
{
result.Add(right.First());
right.RemoveFirst();
}
}
else if (left.Length > 0)
{
result.Add(left.First());
left.RemoveFirst();
}
else if (right.Length > 0)
{
result.Add(right.First());
right.RemoveFirst();
}
}
return(result);
}