Change low , high , and middle to be pointers to array elements rather than integers representing the array indices. Change the split function to return a pointer, not an integer.

/* Sorts an array of integers using Quicksort algorithm */ /*Copyright K.N. King - C programming Ch9.6*/ #include #define N 10 void quicksort (int al], int low, int high) int split(int al], int low, int high) int main(void) [ int a[N], i; printf("Enter %d numbers to be sorted: ", N) scanf("%d", &a [i]) quicksort(a, 0, N - 1) printf ("In sorted order: ") printf ("%d ", a[1]) printf ("ln" return 0 void quicksort (int a[], int low, int high) int middle if (low high) return; middle - split(a, low, high) quicksort (a, low, middle - 1): quicksort (a, middle + 1, high) int split(int al], int low, int high) [ int part element = a[low] for(::) I while (lowhigh && part element = a[high]) high- if (low = high) break allow++] a[high] while (lowhigh && a[10 (z part element) lowtt if (low >- high) break a [high-] = a[low] ; a[high] part-element return high