#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
#define OK 1
#define ERROR -1
#define MAXNUM 11
typedef int Status;
// use define a basic struct shape
typedef struct {
int key; // key field
char *otherInfo;
}ElemType;
typedef struct {
ElemType *data;
int length;
}sqList;
// in this program we will reverse the all sequence
// or other says sort from low to high
// Create basic Sort
void CreateSort(sqList &l) {
// Allocate size
l.data = new ElemType[MAXNUM + 1];
l.length = MAXNUM;
int i = 1;
for (int j = MAXNUM; j >= 1; j--) {
// allocate
l.data[i++].key = j;
}
}
void Print_result(sqList l) {
for (int i = 1; i < l.length; i++) {
cout << l.data[i].key << " ";
}
}
void SelectSort(sqList &l) {
int k;
ElemType t;
// every minest as select num
for (int i = 1; i < l.length; i++) {
//converse until endl
k = i; // tempory conserve
for (int j = i + 1; j < l.length; j++) {
// if use we will not use again ,just because it always sorted
if (l.data[k].key > l.data[j].key) {
k = j;
}// if
}// for
if (k != i) {
t = l.data[i];
l.data[i] = l.data[k];
l.data[k] = t;
}
}
}
void main() {
sqList l;
CreateSort(l);
Print_result(l);
SelectSort(l);
Print_result(l);
char c;
cin >> c;
}
Select Sort
最新推荐文章于 2021-12-27 00:03:39 发布