自己生成随机样本做比对验证排序等算法是否正确
#include<iostream>
#include<math.h>
using namespace std;
//生成一个数组,长度[0, maxlen-1],每个值[0, maxvalue-1]
int* lenRandomValueRandom(int maxlen, int maxvalue) {
int len = (int)(rand() * maxlen);
int* ret = new int[len];
for (int i = 0; i < len; i++) {
ret[i] = (int)(rand() * maxvalue);
}
return ret;
}
//备份数组
int* copyArray(int* arr, int len) {
int* ret = new int[len];
for (int i = 0; i < len; i++) {
ret[i] = arr[i];
}
return ret;
}
//判断数组是否是升序的
bool isSorted(int* arr, int len) {
int Max = arr[0];
for (int i = 0; i < len; i++) {
if (Max > arr[i]) {
return false;
}
Max = max(Max,arr[i]);
}
return true;
}
//选择排序
void Swap(int& a, int& b) {
int tmp = a;
a = b;
b = tmp;
}
void SelectSort(int* arr, int len) {
if (arr == NULL || len < 2) {
return;
}
for (int i = 0; i < len; i++) {
int minIndex = i;
for (int j = i + 1; j < len; j++) {
minIndex = arr[j] < arr[minIndex] ? j : minIndex;
}
Swap(arr[i], arr[minIndex]);
}
}
//打印数组
void Show(int arr[], int len) {
for (int i = 0; i < len; i++) {
cout << arr[i] << ' ';
}
}
int main() {
int maxlen = 50;
int maxvakue = 1000;
int testTime = 10000;
for (int i = 0; i < testTime; i++) {
//生成随机数组
int* arr1 = lenRandomValueRandom(maxlen, maxvakue);
int len = sizeof(arr1) / sizeof(arr1[0]);
//备份生成的数组
int* temp = copyArray(arr1, len);
//选择排序
SelectSort(arr1, len);
//如果不是升序的,打印备份的数组,输出选择排序错误
if (!isSorted(arr1)) {
Show(temp, len);
cout<<"选择排序错误";
break;
}
}
}