-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort_quick.cpp
More file actions
75 lines (63 loc) · 1.09 KB
/
sort_quick.cpp
File metadata and controls
75 lines (63 loc) · 1.09 KB
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
72
73
74
75
#include <iostream.h>
#include <conio.h>
void tampilkan_larik(int data[], int n)
{
int i;
for (i=1;i<=n;i++)
cout<<data[i]<<" ";
cout<<"\n";
}
int partisi (int data[], int awal, int akhir)
{
int x,i,j,simpan;
//x=data[awal];
i=awal;
j=akhir;
while(1)
{
while(data[i]<data[awal])
i=i+1;
while(data[j]>data[awal])
j=j-1;
if (i<j)
{
//tukarkan data
simpan=data[i];
data[i]=data[j];
data[j]=simpan;
}
else
return j;
}
}
void quick_sort(int data[], int awal, int akhir)
{
int q;
if(awal<akhir)
{
q=partisi(data,awal,akhir);
quick_sort(data,awal,q);
quick_sort(data, q+1,akhir);
}
}
int main()
{
int i,j,n,data[100];
cout<<"masukkan banyak data= ";cin>>n;
for(i=1;i<=n;i++)
{
cout<<"data ke-"<<i<<" = ";cin>>data[i];
}
cout<<"Data sebelum diurut: "<<endl;
for(j=1;j<=n;j++)
{
cout<<data[j]<<" ";
}
quick_sort(data,1,n);
//hasil pengurutan
cout<<endl;
cout<<endl;
cout<<"hasil pengurutan:\n";
tampilkan_larik(data,n);
getch();
}