void swap(int *a, int *b) {int t = *a;
*a = *b;
*b = t;
}
int partition(int array[], int low, int high) {int pivot = array[high];
int i = low - 1;
for (int j = low; j < high; j++) { if (array[j] <= pivot) {i++;
swap(&array[i], &array[j]);
}
}
swap(&array[high], &array[i + 1]);
return i + 1;
}
/**
* Simple implementation of the Quick Sort algorithm.
*/
void quick_sort(int array[], int low, int high) { if (low < high) {int pi = partition(array, low, high);
quick_sort(array, low, pi - 1);
quick_sort(array, pi + 1, high);
}
}
void swap(int *a, int *b) {int t = *a;
*a = *b;
*b = t;
}
int partition(int array, int low, int high) {
int pivot = array[high];
int i = low - 1;
// Move all the elements higher than the pivot
// to the left side of the partition
for (int j = low; j < high; j++) { if (array[j] <= pivot) {i++;
swap(&array[i], &array[j]);
}
}
swap(&array[i + 1], &array[high]);
return i + 1;
}
void quick_sort(int array[], int low, int high) { if (low < high) {int pi = partition(array, low, high);
quick_sort(array, low, pi - 1);
quick_sort(array, pi + 1, high);
}
}
void swap(int *a, int *b) {int t = *a;
*a = *b;
*b = t;
}
int partition(int array, int low, int high) {
int pivot = array[high];
int i = low - 1;
for (int j = low; j < high; j++) { if (array[j] <= pivot) {i++;
swap(&array[i], &array[j]);
}
}
swap(
&array[i + 1],
&array[high]
);
return i + 1;
}
void quick_sort(int array[], int low, int high) { if (low < high) {int pi = partition(array, low, high);
quick_sort(array, low, pi - 1);
quick_sort(array, pi + 1, high);
}
}