#include <stdio.h> void swap(int* a, int* b) { int temp = *a; *a = *b; *b = temp; } int partition(int arr[], int low, int high) { int pivot = arr[high]; // Choose the last element as the pivot int i = (low - 1); // Index of the smaller element for (int j = low; j <= high - 1; j++) { // If the current element is smaller than or equal to the pivot if (arr[j] <= pivot) { i++; // Increment the index of the smaller element 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) { // Partitioning index int pi = partition(arr, low, high); // Recursively sort elements before and after partition quickSort(arr, low, pi - 1); quickSort(arr, pi + 1, high); } } int main() { int arr[] = {12, 11, 13, 5, 6, 7}; int size = sizeof(arr) / sizeof(arr[0]); printf("Original Array: "); for (int i = 0; i < size; i++) { printf("%d ", arr[i]); } quickSort(arr, 0, size - 1); printf("\nSorted Array: "); for (int i = 0; i < size; i++) { printf("%d ", arr[i]); } return 0; }
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter