数据结构：简单选择排序

#include <iostream> 
#include <cstdio>
#include <cstdlib>
#include <ctime>

using namespace std;
/*
简单选择排序
*/

int main(){
	int arr1[100];
	//这里使用100个随机数
	int n = 100;
	for(int i = 0; i<n ;i++){
		arr1[i] = rand();
	} 

	cout<<"100个随机数为："<<endl;
	for(int i = 0; i<n; i++){
		cout<<arr1[i]<<" ";
	}
	cout<<endl<<"100个随机数排序之后为："<<endl;
	
	int i, j, k;
	
	for(i = 0; i<n; i++){
		
		k = i;
		
		for(j = i+1; j<n; j++){
			if(arr1[k] > arr1[j]){
				k = j;
			}
		}
		if(k != i){
			int temp;
			temp = arr1[i];
			arr1[i] = arr1[k];
			arr1[k] = temp;
		}
	}
	

	for(int i = 0; i<n; i++){
		cout<<arr1[i]<<" ";
	}
        
        return 0;
}