quick_sort.c
sorting Implementation
53 lines989 bytesC
1// Quick Sort
2#include <stdio.h>
3
4void swap(int* a, int* b) {
5 int temp = *a;
6 *a = *b;
7 *b = temp;
8}
9
10int partition(int arr[], int low, int high) {
11 int pivot = arr[high];
12 int i = low - 1;
13
14 for (int j = low; j < high; j++) {
15 if (arr[j] < pivot) {
16 i++;
17 swap(&arr[i], &arr[j]);
18 }
19 }
20 swap(&arr[i + 1], &arr[high]);
21 return i + 1;
22}
23
24void quickSort(int arr[], int low, int high) {
25 if (low < high) {
26 int pi = partition(arr, low, high);
27 quickSort(arr, low, pi - 1);
28 quickSort(arr, pi + 1, high);
29 }
30}
31
32void display(int arr[], int n) {
33 for (int i = 0; i < n; i++) {
34 printf("%d ", arr[i]);
35 }
36 printf("\n");
37}
38
39int main() {
40 int arr[] = {10, 7, 8, 9, 1, 5};
41 int n = sizeof(arr) / sizeof(arr[0]);
42
43 printf("Original array: ");
44 display(arr, n);
45
46 quickSort(arr, 0, n - 1);
47
48 printf("Sorted array: ");
49 display(arr, n);
50
51 return 0;
52}
53