选择排序实现

// c_dataStructure.cpp : 定义控制台应用程序的入口点。//#include "stdafx.h"#include<iostream>using namespace std;template<class T>void SelectionSort_C(T data[], int n) {for (int i = 0, j, least; i < n - 1; i++) {for (j = i + 1, least = i; j < n; j++) {if (data[j] < data[least]) {least = j;}}// swap(data[least], data[i]);T tmp;tmp = data[i];data[i] = data[least];data[least] = tmp;}}template<class T>void swap(T a, T b) {T tmp;if (a > b) {tmp = b;b = a;a = tmp;}}int main(){int A[10] = { 1, 4, 6, 23, 5, 2, -1, 9, 4, 40 };for (int i = 0; i < 10; i++) {cout << A[i] << " ";}cout << endl;SelectionSort_C(A, 10);for (int i = 0; i < 10; i++) {cout << A[i] << " ";}cout << endl;    return 0;}