|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
void quickSort1(int* root,int low,int high)
{
int pat=root[low];
if(low<high)
{
int i=low,j=high;
while(i<j)
{
while(i<j&&root[j]>pat)
j--;
root[i]=root[j];
while(i<j&&root[i]<pat)
i++;
root[j]=root[i];
}
root[i]=pat;
quickSort1(root,low,i-1);
quickSort1(root,i+1,high);
}
}
|
快排的非递归
|
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
|
int partion(int* root,int low,int high)
{
int part=root[low];
while(low<high)
{
while(low<high&&root[high]>part) high--;
root[low]=root[high];
while(low<high&&root[low]<part) low++;
root[high]=root[low];
}
root[low]=part;
return low;
}
void quickSort2(int* root,int low,int high)
{
stack<int> st;
int k;
if(low<high)
{
st.push(low);
st.push(high);
while(!st.empty())
{
int j=st.top();st.pop();
int i=st.top();st.pop();
k=partion(root,i,j);
if(i<k-1)
{
st.push(i);
st.push(k-1);
}
if(k+1<j)
{
st.push(k+1);
st.push(j);
}
}
}
}
int main()
{
int a[8]={4,2,6,7,9,5,1,3};
quickSort1(a,0,7);
//quickSort2(a,0,7);
int i;
for(i=0;i<8;i++)
cout<<a[i]<<" ";
cout<<endl;
getchar();
return 0;
}
|
感谢阅读，希望能帮助到大家，谢谢大家对本站的支持！
原文链接：http://blog.csdn.net/jamesjxin/article/details/6943545