-
Notifications
You must be signed in to change notification settings - Fork 0
/
quickcode.html
86 lines (68 loc) · 1.67 KB
/
quickcode.html
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
76
77
78
79
80
81
82
83
84
85
86
<!DOCTYPE html>
<html lang="en" dir="ltr">
<head>
<meta charset="utf-8">
<title></title>
<style>
body {padding-top:50px ; margin-top: auto; margin-left: 30px;background-color:#0c7b93;color: white}
h1 {text-align: center; color: black;}
</style>
</head>
<body>
<h1>QUICK SORT
<div class="">
<button onclick="location.href='index.html'">Go to Home Page</button> <br /><br />
</div></h1>
#include <iostream><br /><br><br />
using namespace std;<br><br />
int partition(int a[],int l,int u)
{<br />
int k,i,j,temp;<br />
k=a[l];<br />
i=l;<br />
j=u+1;<br />
do
{<br />
do<br />
i++;<br />
while(a[i]<k&&i<=u);<br />
do<br />
j--;<br />
while(k<a[j]);<br />
if(i<j)
{<br />
temp=a[i];<br />
a[i]=a[j];<br />
a[j]=temp;
}<br />
}while(i<j);<br />
a[l]=a[j];<br />
a[j]=k;<br />
return(j);
}<br />
void quick_sort(int a[],int l,int u)
{<br />
int j;<br />
if(l<u)<br />
{<br />
j=partition(a,l,u);<br />
quick_sort(a,l,j-1);<br />
quick_sort(a,j+1,u);
}
}<br />
int main()
{<br />
int a[10],n,i;<br />
cout<<"Enter number of elements \n";<br />
cin>>n;<br />
cout<<"Enter elements:";<br />
for(i=0;i<n;i++)<br />
cin>>a[i];<br />
quick_sort(a,0,n-1);<br />
cout<<"Array after sorting:\n";<br />
for(i=0;i < n;i++)<br />
cout < < a[i] < < " ";<br />
return 0;
}<br />
</body>
</html>