C语言实现选择排序算法描述如下:
(1)初始时,数组全为无序区为a[0...n-1]。令i = 0。
(2)在无序区a[i...n-1]中选取一个最小的元素,将其与a[i]交换。交换之后a[0...i]就形成了一个有序区。
(3)i++并重复第二步,直到i == n-1,排序完成。
chenyufeng1991/SelectSort
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
C语言实现选择排序
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published