#pragma once
#ifndef _9_12_H
#define _9_12_H
//辅助函数交换x,y的值
template<class T>
void mySwap(T &x, T &y) {
T temp = x;
x = y;
y = temp;
}
//直接选择排序
template<class T>
void selectionSort(T a[], int n) {
for (int i = 0; i < n; i++) {
int leastIndex = i;
//在元素a[i+1]到a[n-1]找出最小值
for (int j = i + 1; j < n; j++) {
if (a[j] < a[leastIndex]) {
leastIndex = j;
}
mySwap(a[i], a[leastIndex]);
}
}
}
#endif // !_9_12_H