本代码结合快排
#include<iostream>
using namespace std;
template<typename T>
int min_re(T a[], int left, int right)
{
T b = a[left];
while (left < right)
{
while (a[right] >= b && right >left)
right--;
a[left] = a[right];
while (a[left] <= b && left < right)
left++;
a[right] = a[left];
}
a[left] = b;
return left;
}
template<typename T>
void quick_sort(T a[], int left, int right)
{
if (left < right)
{
int mid = min_re(a, left, right);
quick_sort(a, left, mid - 1);
quick_sort(a, mid + 1, right);
}
}
int main()
{
int a[5] = { 5,4,3,3,1 };
char b[5]={'e','d','c','b','a'};
quick_sort(b,0,4);
quick_sort(a, 0, 4);
for (int i=0 ;i<5;i++)
cout << a[i]<<" ";
cout<<endl;
for (int i=0 ;i<5;i++)
cout << b[i]<<" ";
cout << endl;
return 0;
}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)