#include <stdio.h>
void swap(int* a, int* b) {
int t = *a;
*a = *b;
*b = t;
}
int partition (int arr\[\], int low, int high) {
int pivot = arrhigh;
int i = (low - 1);
for (int j = low; j <= high - 1; j++) {
if (arrj < pivot) {
i++;
swap(&arri, &arrj);
}
}
swap(&arri + 1, &arrhigh);
return (i + 1);
}
void quickSort(int arr\[\], int low, int high) {
if (low < high) {
int pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
void printArray(int arr\[\], int size) {
for (int i = 0; i < size; i++)
printf("%d ", arri);
printf("\n");
}
int main() {
int arr\[\] = {10, 7, 8, 9, 1, 5};
int n = sizeof(arr)/sizeof(arr0);
quickSort(arr, 0, n-1);
printf("Sorted array: \n");
printArray(arr, n);
return 0;
}