public static void Algorithm()
{
Merge_Sort sort = new Merge_Sort();
Binrary_Search_Tree search = new Binrary_Search_Tree();
//sort.Test();
search.Test();
}
public void mergeSortBase_notSortedArray_SortedArrayByAscending()
{
var notSortedArray = GetNotSortedArray;
var sortedArrayByAscending = notSortedArray.OrderBy(x => x);
var resultArray = Merge_Sort.sort(notSortedArray);
Assert.AreEqual(resultArray, sortedArrayByAscending);
}
// main
public static void Main(String[] args)
{
Random r = new Random();
int arrSize = r.Next(10, 15);
Console.WriteLine("Array Size = {0}, enter your array elements", arrSize);
int[] array = new int[arrSize];
for (int i = 0; i < arrSize; i++)
{
array[i] = Convert.ToInt32(Console.ReadLine());
}
Console.WriteLine("Given Array");
printArray(array);
Merge_Sort ob = new Merge_Sort();
ob.sort(array, 0, array.Length - 1);
Console.WriteLine("\nSorted array");
printArray(array);
}
public void MergeSort_ValidInput_SortedOutPut()
{
var mergeSort = new Merge_Sort();
RunTestsForSortAlgorithm(mergeSort.MergeSort);
}
