文件名称:jiandanxuanze
介绍说明－－下载内容均来自于网络，请自行研究使用
基本思想：
设所排序序列的记录个数为ｎ。i取1,2,…,n-1,从所有n-i+1个记录（R,R[i+1],…,R[n]中找出排序码最小的记录，与第ｉ个记录交换。执行n-1趟 后就完成了记录序列的排序。
-The basic idea: set up the sort of record sequence number for n. i get 1,2, ..., n-1, from all n-i+ 1 record (R, R [i+ 1], ..., R [n] in order to identify the smallest code records, with the first i records the exchange. the implementation of n-1 times after the completion of the record of the sort sequence.
设所排序序列的记录个数为ｎ。i取1,2,…,n-1,从所有n-i+1个记录（R,R[i+1],…,R[n]中找出排序码最小的记录，与第ｉ个记录交换。执行n-1趟 后就完成了记录序列的排序。
-The basic idea: set up the sort of record sequence number for n. i get 1,2, ..., n-1, from all n-i+ 1 record (R, R [i+ 1], ..., R [n] in order to identify the smallest code records, with the first i records the exchange. the implementation of n-1 times after the completion of the record of the sort sequence.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
简单选择排序
............\SelectSort.cpp
............\SelectSort.exe
............\SelectSort.cpp
............\SelectSort.exe