You already have the partition function from quick sort.

Write the complete program for Quick select in C programming!

Quick Sort:

#include

$//$ Function to swap two elements

void swap$($int$*$ a$,$ int$*$ b$)\{$

int temp $=*$a;

$*$a $=*$b;

$*$b $=$ temp;

$\}$

$//$ Partition function for Quick Sort

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)$;

$\}$

$//$ Quick Sort function

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$)$;

$\}$

$\}$

$//$ Function to print an array

void printArray$($int arr$[],$ int size$)\{$

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

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

printf$("$

$")$;

$\}$

int main$()\{$

int arr$[]=\{10,7,8,9,1,5\}$;

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

quickSort$($arr$,0,$ n $-1)$;

printf$("$Sorted array: $")$;

printArray$($arr$,$ n$)$;

return $0$;

$\}$