-
Notifications
You must be signed in to change notification settings - Fork 2
/
quick sort
71 lines (68 loc) · 944 Bytes
/
quick sort
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
70
71
#include<stdio.h>
#include<conio.h>
#include<alloc.h>
int *a, n;
void quicksort(int p, int q);
int partition(int m, int p);
void main()
{
int i;
clrscr();
printf(" Enter array size: ");
scanf("%d",&n);
a= (int *) malloc (n);
printf("\n Enter %d integers. : ",n);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
printf("\n");
printf("\n quicksort(%d,%d)",1,n);
quicksort(1,n);
printf("\n Sorted List : ");
for(i=1;i<=n;i++)
printf("%3d ",a[i]);
getch();
}
void quicksort(int p, int q)
{
int j;
if(p<q)
{
j = partition(p,q+1);
printf("\nj = %3d",j);
2
getch();
printf("\n quicksort(%d,%d)",p,j-1);
quicksort(p,j-1);
printf("\n quicksort(%d,%d)",j+1,q);
quicksort(j+1,q);
}
}
int partition(int m, int p)
{
int v, i, j, t, k;
v = a[m]; //Partition element
i=m;
j=p;
do
{
do
{
i++;
} while(v > a[i]);
do
{
j--;
} while(v < a[j]);
if(i<j)
{
t=a[i];
a[i] = a[j];
a[j]=t;
}
} while(i<j);
a[m]=a[j];
a[j]=v;
for(k=m; k<p; k++)
printf("%3d ", a[k]);
return j;
}