forked from neiljaviya/algos-1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Quick_sort.c
69 lines (50 loc) · 1.19 KB
/
Quick_sort.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
63
64
65
66
67
68
69
#include <stdio.h>
#include <conio.h>
void quickSort(int a[], int first, int last) {
int temp, low, high, p;
low = first;
high = last;
p = a[(first+last)/2];
do {
while(a[low] < p) {
low++;
}
while (a[high] > p) {
high--;
}
if(low <= high) {
temp= a[low];
a[low] = a[high];
a[high]= temp;
low++;
high--;
}
}while(low<=high);
if(first < high){
quickSort(a, first, high);
}
if(low < last) {
quickSort (a, low, last);
}
}
void main() {
int n;
int a[20];
printf("\n Enter Number of elements : ");
scanf("%5d", &n);
printf("\n Enter %d element: ", n);
for( int i=0;i<n;i++) {
printf ("Enter the [%d] Element : ", i+1);
scanf("%5d", &a[i]);
}
printf("\n Original array is : ");
for(int i=0; i<n; i++) {
printf("%5d ", a[i]);
}
quickSort(a, 0, n-1);
printf("\n Sorted array is : ");
for (int i=0; i<n;i++) {
printf("%5d ", a[i]);
}
getch();
}