Description: The first number selection sort elect one of the most value per trip and disordered sequence exchange, choose the number n of n-1 times. I assume that i first trip to the index value, then the value and i+1 to last a few comparison to find the best value under the standard, if the value of the initial value of the subscript is not, then the value of the element and the subscript i is the element exchange.
To Search:
File list (Check if you may need any files):
SORT - selection\Debug\Bubble Sort.obj
................\.....\Selection Sort.obj
................\.....\SORT.pch
................\.....\SORT.pdb
................\.....\vc60.idb
................\.....\vc60.pdb
................\Selection Sort.cpp
................\SORT.dsp
................\SORT.dsw
................\SORT.ncb
................\SORT.opt
................\SORT.plg
................\Debug
SORT - selection
Download