public static void SearchingTechniquesMain()
{
/* _____________________________Linear Search____________________________________ */
linear:
InitialArray = ArrayHandler.GetPopulatedArray(n, minVal, maxVal);
Console.WriteLine("Array: \n");
ArrayHandler.PrintArray(InitialArray);
Console.WriteLine();
Console.WriteLine("Linear Search:");
Console.Write("Enter the element to be found: ");
if (!int.TryParse(Console.ReadLine(), out int searchElement))
{
Console.WriteLine("\nInvalid input. Please try again.");
Console.WriteLine("\nPress any key to continue...");
Console.ReadKey();
Console.Clear();
goto linear;
}
LinearSearch(searchElement);
Console.WriteLine("\n");
Console.WriteLine("Press any key to continue...");
Console.ReadKey();
Console.Clear();
/* _____________________________Binary Search____________________________________ */
binary:
InitialArray = ArrayHandler.GetPopulatedArray(n, minVal, maxVal);
Console.WriteLine("Array: \n");
ArrayHandler.PrintArray(InitialArray);
Console.WriteLine();
Console.WriteLine("Binary Search:");
Console.Write("Enter the element to be found: ");
if (!int.TryParse(Console.ReadLine(), out searchElement))
{
Console.WriteLine("\nInvalid input. Please try again.");
Console.WriteLine("\nPress any key to continue...");
Console.ReadKey();
Console.Clear();
goto binary;
}
BinarySearch(SortingTechniques.SortForExternal((int[])InitialArray.Clone()), 0, n - 1, searchElement);
Console.WriteLine();
Console.WriteLine("Press any key to continue...");
}
public static void SortingTechniquesMain()
{
Stopwatch sw = new Stopwatch();
/* _____________________________Bubble Sort____________________________________ */
InitialArray = ArrayHandler.GetPopulatedArray(n, minVal, maxVal);
Console.WriteLine("Initial Array: \n");
ArrayHandler.PrintArray(InitialArray);
Console.WriteLine();
Console.WriteLine("Bubble Sort: \n");
sw.Start();
BubbleSort();
Console.WriteLine("\nTime taken: " + sw.Elapsed);
sw.Reset();
Console.WriteLine("\n");
Console.WriteLine("Press any key to continue...");
Console.ReadKey();
Console.Clear();
/* _____________________________Selection Sort____________________________________ */
InitialArray = ArrayHandler.GetPopulatedArray(n, minVal, maxVal);
Console.WriteLine("Initial Array: \n");
ArrayHandler.PrintArray(InitialArray);
Console.WriteLine();
Console.WriteLine("Selection Sort: \n");
sw.Start();
SelectionSort();
Console.WriteLine("\nTime taken: " + sw.Elapsed);
sw.Reset();
Console.WriteLine("\n");
Console.WriteLine("Press any key to continue...");
Console.ReadKey();
Console.Clear();
/* _____________________________Insertion Sort____________________________________ */
InitialArray = ArrayHandler.GetPopulatedArray(n, minVal, maxVal);
Console.WriteLine("Initial Array: \n");
ArrayHandler.PrintArray(InitialArray);
Console.WriteLine();
Console.WriteLine("Insertion Sort: \n");
sw.Start();
InsertionSort();
Console.WriteLine("\nTime taken: " + sw.Elapsed);
sw.Reset();
Console.WriteLine("\n");
Console.WriteLine("Press any key to continue...");
Console.ReadKey();
Console.Clear();
/* _____________________________Merge Sort____________________________________ */
InitialArray = ArrayHandler.GetPopulatedArray(n, minVal, maxVal);
Console.WriteLine("Initial Array: \n");
ArrayHandler.PrintArray(InitialArray);
Console.WriteLine();
Console.WriteLine("Merge Sort: \n");
sw.Start();
MergeSort(0, n - 1);
Console.WriteLine("\nTime taken: " + sw.Elapsed);
sw.Reset();
Console.WriteLine("\n");
Console.WriteLine("Press any key to continue...");
Console.ReadKey();
Console.Clear();
/* _____________________________Quick Sort____________________________________ */
InitialArray = ArrayHandler.GetPopulatedArray(n, minVal, maxVal);
Console.WriteLine("Initial Array: \n");
ArrayHandler.PrintArray(InitialArray);
Console.WriteLine();
Console.WriteLine("Quick Sort: \n");
sw.Start();
QuickSort(0, n - 1, true);
Console.WriteLine("\nTime taken: " + sw.Elapsed);
sw.Reset();
Console.WriteLine("\n");
Console.WriteLine("Press any key to continue...");
}
