-
Notifications
You must be signed in to change notification settings - Fork 4
/
quicksort.c
68 lines (63 loc) · 1.02 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
63
64
65
66
67
68
//Quick Sort
#include<stdio.h>
void swap(int *a,int *b)
{
int t=*a;
*a=*b;
*b=t;
}
int partition(int arr[],int l,int r)
{
int pi=arr[l];
int d=l+1;
int u=r;
while(1)
{
while(arr[d]<=pi && d<u)
{
d++;
}
while(arr[u]>pi)
{
u--;
}
if(d<u)
{
swap(&arr[d],&arr[u]);
}
else
{
swap(&arr[u],&arr[l]);
break;
}
}
return u;
}
void quicksort(int arr[],int l,int r)
{
if(l<r)
{
int p=partition(arr,l,r);
quicksort(arr,l,p-1);
quicksort(arr,p+1,r);
}
}
int main()
{
int n;
printf("\nEnter the No of Elements: ");
scanf("%d",&n);
int arr[n];
printf("\nEnter the Elements: ");
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
quicksort(arr,0,n-1);
printf("\nAfter Sorting the elements are: ");
for(int i=0;i<n;i++)
{
printf("%d ",arr[i]);
}
return 0;
}