static void Main(string[] args)
{
int size = 20;
CustomArray arrOfNums = new CustomArray(size);
CustomArray sortedArray = new CustomArray(size);
Random rnd = new Random(100);
for (int i = 0; i < size; i++)
{
arrOfNums.Insert((int)(rnd.NextDouble() * 100));
}
BubbleSort bs = new BubbleSort(arrOfNums);
bs.Sort();
Console.ReadLine();
}
static void Main(string[] args)
{
int n = Convert.ToInt32(Console.ReadLine());
int[] A = new int[n];
Random random = new Random();
for (int i = 0; i < n; ++i)
{
A[i] = random.Next(0, 100);
Console.WriteLine(A[i] + " ");
}
string a = Console.ReadLine();
int size = a.Length;
char[] b = new char[size];
Change(a, b);
for (int i = 0; i < b.Length; ++i)
{
switch (b[i])
{
case '1':
Console.WriteLine("Insertion Sort ");
int[] B = new int[A.Length];
for (int k = 0; k < B.Length; ++k)
{
B[k] = A[k];
}
InsertionSort.insertionSort(B);
InsertionSort.PrintArr(B);
break;
case '2':
Console.WriteLine("Merge Sort");
int[] C = new int[A.Length];
for (int k = 0; k < C.Length; ++k)
{
C[k] = A[k];
}
MergeSort.mergeSort(C, 0, C.Length - 1);
MergeSort.PrintArr(C);
break;
case '3':
Console.WriteLine("Bubble Sort");
int[] D = new int[A.Length];
for (int k = 0; k < D.Length; ++k)
{
D[k] = A[k];
}
BubbleSort.BBSort(D);
BubbleSort.PrintArr(D);
break;
case '4':
Console.WriteLine("Quick Sort");
int[] E = new int[A.Length];
for (int k = 0; k < E.Length; ++k)
{
E[k] = A[k];
}
QuickSort.quicksort(E, 0, E.Length - 1);
QuickSort.PrintArr(E);
break;
}
}
Console.ReadKey();
}
