Mirrors/interview
1
0
Fork 0
mirror of https://github.com/huihut/interview.git synced 2025-12-18 13:04:38 +03:00
Code Issues Actions Packages Projects Releases Wiki Activity

把排序算法的描述放到代码中，让README简洁点

Browse Source
This commit is contained in:
huihut
2018-04-16 13:37:25 +08:00
parent 3a0079899d
commit fd5ba9d077
5 changed files with 20 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Algorithm/SelectionSort.h
View File

@@ -1,5 +1,7 @@
/*
（有序区，无序区）。在无序区里找一个最小的元素跟在有序区的后面。对数组：比较得多，换得少。
选择排序思路：
1. 在未排序序列中找到最小（大）元素，存放到排序序列的起始位置
2. 从剩余未排序元素中继续寻找最小（大）元素，然后放到已排序序列的末尾