public void TestSort()
{
int[] arr = new int[] { 10, 64, 7, 99, 32, 18, 2, 48 };
Insertionsort.Sort(arr);
Assert.Equal(new int[] { 2, 7, 10, 18, 32, 48, 64, 99 }, arr);
arr = new int[] { 10, 64, 7, 99, 32, 18 };
Insertionsort.Sort(arr);
Assert.Equal(new int[] { 7, 10, 18, 32, 64, 99 }, arr);
}
static void Main()
{
List<int> array = new List<int> { 123, 12312, 3232, 21, 432, 123414 };
Insertionsort algorithm = new Insertionsort(array);
foreach (int i in algorithm.Sort())
{
Console.Write(i + " ");
}
}
static void Main()
{
List <int> array = new List <int> {
123, 12312, 3232, 21, 432, 123414
};
Insertionsort algorithm = new Insertionsort(array);
foreach (int i in algorithm.Sort())
{
Console.Write(i + " ");
}
}
static void Main(string[] args)
{
//lesson one
Console.WriteLine(CreateHeader("Sequential search"));
Console.WriteLine(SequentialSearch.Sequentialsearch("Tim"));
Console.WriteLine(CreateHeader("Binary search"));
Console.WriteLine(BinarySearch.Binarysearch(25));
//lesson two
Console.WriteLine(CreateHeader("Insertion sort"));
Console.WriteLine(Insertionsort.InsertionSort());
Console.WriteLine(CreateHeader("Bubble sort"));
Console.WriteLine(Bubblesort.BubbleSort());
Console.WriteLine(CreateHeader("Merge sort"));
Console.WriteLine(Mergesort.MergeSort());
Console.ReadLine();
}
static void Main(string[] args)
{
int[] arrayLength = { 100, 500, 1000, 5000, 10000, 50000, 100000 };
Insertionsort insertionSort = new Insertionsort();
Mergesort mergeSort = new Mergesort();
Quicksort quickSort = new Quicksort();
Radixsort radixSort = new Radixsort();
Selectionsort selectionSort = new Selectionsort();
Shellsort shellSort = new Shellsort();
TestArrays arrayGen = new TestArrays();
for (int i = 0; i < arrayLength.Length; i++)
{
int[] mass = arrayGen.sortedArray(arrayLength[i]);
insertionSort.SortArray(mass);
mergeSort.SortArray(mass);
quickSort.SortArray(mass);
radixSort.SortArray(mass);
selectionSort.SortArray(mass);
shellSort.SortArray(mass);
}
for (int i = 0; i < arrayLength.Length; i++)
{
int[] mass = arrayGen.randomArray(arrayLength[i]);
insertionSort.SortArray(mass);
mergeSort.SortArray(mass);
quickSort.SortArray(mass);
radixSort.SortArray(mass);
selectionSort.SortArray(mass);
shellSort.SortArray(mass);
}
for (int i = 0; i < arrayLength.Length; i++)
{
int[] mass = arrayGen.reverseArray(arrayLength[i]);
insertionSort.SortArray(mass);
mergeSort.SortArray(mass);
quickSort.SortArray(mass);
radixSort.SortArray(mass);
selectionSort.SortArray(mass);
shellSort.SortArray(mass);
}
}
