#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void swap(int* a, int* b) {
int t = *a;
*a = *b;
*b = t;}
int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = (low - 1);
for (int j = low; j <= high - 1; j++) {
if (arr[j] <= pivot) {
i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i + 1], &arr[high]);
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);
}
}
int main() {
int arr[10000];
int i, n;
printf("Enter the size of the array: ");
scanf("%d", &n);
printf("Enter the elements of the array:\n");
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
clock_t start, end;
double cpu_time_used;
start = clock();
quickSort(arr, 0, n - 1);
end = clock();
cpu_time_used = ((double) (end - start)) / CLOCKS_PER_SEC;
printf("\nRunning time: %f seconds\n", cpu_time_used);
printf("Sorted array:\n");
for (i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}
Output:
Enter the size of the array: 10
Enter the elements of the array:
32 54 23 2 24 78 57 42 12 31
Running time: 0.000003 seconds
Sorted array:
2 12 23 24 31 32 42 54 57 78
