笙尽缘无

void BinarySelectSort(int r[], int n) { int i, j, min, max, tmp; for (i = 1; i <= n / 2; i++) { // 做不超过n/2趟选择排序 min = i; max = i; //分别记录最大和最小关键字记录位置 for (j = i + 1;

void print(int a[], int n, int i){cout for (int j = 0; j cout }cout }//得到数组比当前值-数小的索引//@return int 数组的键值i

void print(int a[], int n, int i){cout for (int j = 0; j cout }cout }/*** 插入排序*/void InsertSort(int a[], int n){/*初始值：3  1  5  7  2  4  9  6*/for (int i = 1; i

#include "stdafx.h"#include;using namespace std;void print(int a[], int n){for (int j = 0; j cout }cout }void ShellInsertSort(int a[], int n, int dk){cout cout // dk = 4

void print(int a[], int n, int i){cout << "第" << i + 1 << "趟 : ";for (int j = 0; j < n; j++){cout << a[j] << " ";}cout << endl;}/*** 插入排序*/void InsertSort(int a[], int n){ /* 初始值：3