int
main()
{
int n;
printf("Enter size of the Array: ");
scanf("%d", &n);
int arr[n];
printf("Enter %d Integers:- \n", n);
int i;
for (i = 0; i < n; ++i)
scanf("%d", &arr[i]);
cycleSort(arr, n);
printf("Array after Sorting:- \n");
for (i = 0; i < n; ++i)
printf("%d ", arr[i]);
printf("\n");
return (0);
}
int main() {
//Print initial array
printf("\n//=====Shuffled array===================//");
setarray();
printarray("Initial Array");
//=====Simple sorts=====//
printf("\n\n//=====Simple sorts====================//");
//Insertion sort
setarray();
insertionSort(array,10);
printarray("InsertionSort");
//Selection sort
setarray();
selectionSort(array,10);
printarray("SelectionSort");
//=====Eficient Sorts=====//
printf("\n\n//=====Eficient sorts==================//");
//Mergesort
setarray();
mergeSort(array,0,9,10);
printarray("MergeSort");
//Heapsort
setarray();
heapSort(array,10);
printarray("HeapSort");
//Quicksort
setarray();
quickSort(array,0,9);
printarray("QuickSort");
//Bubble sort and variants
printf("\n\n//=====Bubble sort and variants========//");
//Bubblesort
setarray();
bubbleSort(array,10);
printarray("BubbleSort");
//Shellsort
setarray();
shellSort(array,10);
printarray("ShellSort");
//Combsort
setarray();
combSort(array,10);
printarray("CombSort");
//Distribution sorts
printf("\n\n//=====Distribution sorts==============//");
//Countingsort
setarray();
countingSort(array, 10, 0, 99);
printarray("CountingSort");
//Radixsort
setarray();
radixSort(array, 10);
printarray("RadixSort");
//Other sorts
printf("\n\n//=====Other sorts=====================//");
//Gnomesort
setarray();
gnomeSort(array,10);
printarray("GnomeSort");
//Cyclesort
setarray();
cycleSort(array,10);
printarray("CycleSort");
printf("\n\n");
}
