yes it is true, but now i cant get back because it is almost done and i only need this function to complete the code.
i am using this function to order the arrays of doubles, and the arrays of ints follow the moves of the arrays of doubles.
i need to use this function again but now only between two numbers, not from the beginning of the array to the end.
void quicksort(double *a, int n, int *array)
int i = 0;
int j = n-1;
double p = a[n/2];
while (a[i] > p)
while (p > a[j])
exchange(a, i++, j--,array);
if (j > 0)
if (i < n-1)
Have you an idea how i can make it with this function?