-
Notifications
You must be signed in to change notification settings - Fork 0
/
QuickSort.c
62 lines (51 loc) · 1 KB
/
QuickSort.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
//QUICK SORT
#include <stdio.h>
void swap(int *a,int *b){
int temp = *a;
*a=*b;
*b=temp;
}
int split(int a[],int low,int high){
int pivot = a[high];
int i = low-1;
int j;
for(j=low;j<high;j++){
if(a[j]<=pivot){
i++;
swap(&a[i],&a[j]);
}
}
swap(&a[i+1],&a[high]);
return (i+1);
}
void quickSort(int a[],int low,int high){
if(high>low){
int x = split(a,low,high);
//recursion for left of pivot
quickSort(a,low,x-1);
//recursion for right of pivot
quickSort(a,x+1,high);
}
}
void printArray(int a[], int size){
int i;
for( i=0;i<size;i++){
printf("%d ",a[i]);
}
}
int main(){
int array[10],i,n,size;
printf("Enter no. of elements of array:");
scanf("%d",&n);
printf("Enter elements:");
for(i=0;i<n;i++){
scanf("%d",&array[i]);
}
printf("***Array Before Sorting**\n");
for(i=0;i<n;i++){
printf("%d ",array[i]);
}
quickSort(array,0,n-1);
printf("\n**After Sorting**\n");
printArray(array,n);
}