public void Test()
{
int[] arr = new int[] { 6, 9, 2, 5, 0, 1, 7, 3, 8 };
ShellSort1(arr);
LogArr.Log(arr);
}
void Start()
{
int[] arr = new int[] { 5, 3, 6, 1, 0 };
SelectionSortFun(arr);
LogArr.Log(arr);
}
public void Test()
{
//int[] arr = new int[] { 5, 3, 6, 1, 0};
int[] arr = new int[] { 9, 1, 6, 0 };
LogArr.Log(arr);
BubbleSortFunc(arr);
LogArr.Log(arr);
}
public void Test()
{
int[] arr = new int[] { 73, 30, 90, 89, 78, 10, 93, 60, 79, 98 };
BucketSortFunc(arr);
LogArr.Log(arr);
}
public void Test()
{
int[] arr = new int[] { 108, 100, 105, 110, 105, 105, 100 };
arr = CountSortFunc(arr);
LogArr.Log(arr, 0, arr.Length);
}
public void Test()
{
int[] arr = new int[] { 6, 2, 5, 0, 1 };
InsertSortFunc(arr);
LogArr.Log(arr);
}
public void Test()
{
int[] arr = new int[] { 6, 1, 8, 0, 0, 9, 5, 3, 7 }; // 0, 1, 3, 5, 6, 7, 8, 9
QuickSortFunc(arr);
LogArr.Log(arr);
}
public void Test()
{
int[] arr = new int[] { 543, 159, 343, 287, 694, 315, 873, 96 };
RadixSortFunc(arr);
LogArr.Log(arr);
}
