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

0 vote176 views1 answer
#define f_cpu
C
0 vote127 views1 answer
Mount cifs
C
0 vote140 views1 answer
Resto de division recursiva
C
1 vote110 views2 answers
Node.js
C
0 vote113 views1 answer
KneesDev
C
0 vote116 views1 answer
How to malloc for matrix in c
C
4 votes114 views2 answers
C get time
C
0 vote123 views1 answer
MongoDb Read
C
0 vote113 views1 answer
C string equal
C
0 vote114 views4 answers
%hd c
C