static void Main(string[] args)
{
int arraySize = 10000000;
RandomArray arr = new RandomArray(arraySize);
arr.FillArrayRandom();
if (arraySize < 10001)
{
Console.WriteLine("Size of the shuffled array :" + arraySize);
Console.WriteLine("Bubble Sort Took(miliseconds):" + BubbleSort.Sort(arr.Clone()));
Console.WriteLine("Selection Sort Took(miliseconds):" + SelectionSort.Sort(arr.Clone()));
Console.WriteLine("Insertion Sort Took(miliseconds):" + InsertionSort.Sort(arr.Clone()));
}
Console.WriteLine("Shell Sort Took(miliseconds):" + ShellSort.Sort(arr.Clone()));
Console.WriteLine("Merge Sort Took(miliseconds):" + MergeSort.Sort(arr.Clone()));
if (arraySize < 100000)
{
Console.WriteLine("Quick Sort Took(miliseconds):" + QuickSort.Sort(arr.Clone()));
}
Console.WriteLine("Counting Sort Took(miliseconds):" + CountingSort.Sort(arr.Clone()));
Console.WriteLine("Radix Sort Took(miliseconds):" + RadixSort.Sort(arr.Clone()));
}
static void Main(string[] args)
{
var rnd = new Random();
var arrSize = rnd.Next(1, 1000);
int[] arr = Enumerable.Repeat(0, arrSize).Select(x => rnd.Next(int.MinValue, int.MaxValue)).ToArray();
var bs = (int[])arr.Clone();
BubbleSort.Sort(bs);
Assert.IsTrue(IsSorted(bs));
var ss = (int[])arr.Clone();
SelectionSort.Sort(ss);
Assert.IsTrue(IsSorted(ss));
var @is = (int[])arr.Clone();
InsertionSort.Sort(@is);
Assert.IsTrue(IsSorted(@is));
var ms = (int[])arr.Clone();
MergeSort.Sort(ms);
Assert.IsTrue(IsSorted(ms));
var qs = (int[])arr.Clone();
QuickSort.Sort(qs);
Assert.IsTrue(IsSorted(qs));
var cs = (int[])arr.Clone();
CountingSort.Sort(cs);
Assert.IsTrue(IsSorted(cs));
var rs = (int[])arr.Clone();
RadixSort.Sort(rs);
Assert.IsTrue(IsSorted(rs));
var hs = (int[])arr.Clone();
HeapSort.Sort(hs);
Assert.IsTrue(IsSorted(hs));
}
public static void Sort(uint[] UnsortedArray, int Length, SortNames AlgorithmName)
{
ISort Algorithm = null;
switch (AlgorithmName)
{
case (SortNames.SelectionSort):
Algorithm = new SelectionSort();
break;
case (SortNames.InsertionSort):
Algorithm = new InsertionSort();
break;
case (SortNames.ShellSort1):
Algorithm = new ShellSort1();
break;
case (SortNames.ShellSort2):
Algorithm = new ShellSort2();
break;
case (SortNames.QuickSort):
Algorithm = new QuickSort();
break;
case (SortNames.MergeSort):
Algorithm = new MergeSort();
break;
case (SortNames.RadixSort):
Algorithm = new RadixSort();
break;
}
Algorithm.Sort(UnsortedArray, Length);
}
