Implementation of a simple sorting algorithm
# include # includevoid insertSortForward (int orig [], int size); void insertSortBackward (int orig [], int size); void bubbleSort (int orig [], int size); void selectSort (int orig [], int size); void shellSort (int orig [], int size); void HeapSort (int orig [], int size); void QuickSort (int [], int, int); void swap (int *, int *); int Partition (int orig [], int left, int right); void BuildHeap (int orig [], int size) Void HeapAdjust (int [], int, int); int main () {int a [] = {1, 0, sizeof (a) / sizeof (a [0]); / bubbleSort (a, 7); / insertSortForward (a, 8); / / insertSortBackward (a, 8); / / selectSort (a, 8); / / shellSort (a, 8); / / HeapSort (a, 9); QuickSort (a, 0, sizeof (a) / sizeof (a [0])-1) I 0) {for (int j = k; j)
< size; j++) { t = orig[j]; i = j - k; while (i >= 0 & & t
< orig[i]) { orig[i+k] = orig[i]; orig[i] = t; i = i - k; } } k /= 2; if (k==0) { break; } } for (int i = 0; i < size; i++) printf("%d ", orig[i]); printf("\n"); }void HeapSort(int orig[], int size){ BuildHeap(orig, size); for (int i = 0; i < size; i++) printf("%d ", orig[i]); printf("\n"); while(size >0) {printf ("% d", orig [0]); orig [0] = orig [--size]; HeapAdjust (orig, 0Magne size);}} void QuickSort (int orig [], int left, int right) {if (left)
< right) { int point = Partition(orig, left, right); QuickSort(orig, left, point - 1); QuickSort(orig, point + 1, right); } }void swap(int *a, int*b) { int temp; temp = *a; *a = *b; *b = temp; }int Partition(int orig[], int left, int right){ int prikey = orig[right]; while (left orig[j + 1]) { int temp = 0; temp = orig[j]; orig[j] = orig[j + 1]; orig[j + 1] = temp; } } } for (int i = 0; i < size; i++) printf("%d ", orig[i]); printf("\n"); }void selectSort(int orig[], int size){ for (int i = 0; i < size; i++) { int min = orig[i]; int index = i; for (int j = i+1; j < size; j++) { if (min >Orig [j]) {min = orig [j]; index = j;}} orig [index] = orig [I]; orig [I] = min;} for (int I = 0; I < size; ionization +) printf ("% d", orig [I]); printf ("\ n");}
