Description: 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.
To Search:
File list (Check if you may need any files):
简单选择排序
............\SelectSort.cpp
............\SelectSort.exe
Download