Function for quicksort in c

#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 = 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);

}

}

void printArray(int arr[], int size)

{

int i;

for (i=0; i < size; i++)

printf("%d ", arr[i]);

printf("n");

}

int main()

{

int arr[] = ;

int n = sizeof(arr)/sizeof(arr[0]);

quickSort(arr, 0, n-1);

printf("The sorted array is: n");

printArray(arr, n);

return 0;

}

Source: hackr.io

Similar codes

1 vote140 views1 answer
Round function in C
C
0 vote145 views1 answer
Check if pid exists c
C
0 vote147 views1 answer
Google sheets transpose new line to table
C
0 vote222 views1 answer
ESP32 timerBegin(0, cpuClock, true);
C
0 vote133 views1 answer
Email dev Microsoft Outlook 2007 items all aligned left or aligned wrong
C
0 vote164 views1 answer
Get file ligne count c
C
1 vote163 views1 answer
ModuleNotFoundError: No module named 'tensorboardX'
C
8 votes176 views2 answers
Millis()
C
-1 vote182 views1 answer
Bash while loop n times
C
-2 votes145 views2 answers
Double pointers in c
C