//int 数组[] = { 9, 0, 8, 1, 7, 2, 6, 3, 5, 4, 4, 5, 3, 6, 2, 7, 1, 8, 0, 9 };
//int 数组[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
int 数组[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
//int 数组[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
//int 数组[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
template <class 形参>
void 海潮音(形参 数组[], int 量)
{
int 标 = 0, 头 = 0, 尾 = 量;
形参 转存 = 0;
do
{
标 = 头;
while (头 < 尾) if (数组[标] > 数组[--尾]) 标 = 尾;/*获得最小下标2017.6.6 17:17*/
if (标 != 头)
{
转存 = 数组[头];
数组[头] = 数组[标];
数组[标] = 转存;
显示数组(数组, 量);
}
尾 = 量;
} while (++头 < 量 - 1);
};
int 数组[] = { 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 ,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 ,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 ,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0 ,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 , 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
9, 8, 7, 6, 5, 4, 3, 2, 1, 0 };
int 量 = sizeof(数组) / sizeof(数组[0]);
clock_t 开始时间 = clock();
海潮音(数组, 量);
clock_t 结束时间 = clock();
cout << "运行时间:" << (double)(结束时间 - 开始时间) / CLOCKS_PER_SEC * 1000 * 1000 << "微秒(μs) " << endl;
显示数组(数组, 量);
C++代码:测试运行时间参考http://www.cnblogs.com/killerlegend/p/3877703.html
这种思路和逻辑很满意的设计作品.假设我的这个作品超过了快排,是否,给我诺贝尔奖?
设计完成,今天看一下各种排序算法,发现居然和选择排序是一样的,虽然是自己推演出来的,与前人思路雷同,如果认为是抄袭,也无言以对.之后一路演绎都是自己的设计,绝非抄袭.2017-6-16 9:06
