数据结构考研分类复习真题 第十章 排序[25]

．下面的排序算法的思想是第一趟比较将最小的元素放在r[]中最大的元素放在r[n]中第二趟比较将次小的放在r[]中将次大的放在r[n]中…依次下去直到待排序列为递增序(注<>)代表两个变量的数据交换)

void sort(SqList &rint n) {

i=;

while(____()____) {

min=max=;

for (j=i+;____()____ ;++j)

{if(____()____) min=j; else if(r[j]key>r[max]key) max=j; }

if(____()_____) r[min] < >r[j];

if(max!=ni+){if (____()____) r[min] < > r[ni+]; else (____()____); }

i++;

}

}//sort 【南京理工大学 三 (分)】

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []