Commit Graph

10 Commits

Author SHA1 Message Date
chenrong
f74a14c60d 插入排序(插入位置,从头至尾搜索) 2018-11-29 17:05:38 +08:00
westGG
99ee504a68 Resovle the conflict of the 11_sorts/Sorts.java 2018-11-04 10:19:11 +08:00
carlos
ac6ad844c9 Merge remote-tracking branch 'upstream/master'
Merge remote-tracking branch 'upstream/master'
2018-10-23 17:51:36 +08:00
Wei Yang
b21be9c796 11_sorts: skip swap in case minIndex equals i
Signed-off-by: Wei Yang <richard.weiyang@gmail.com>
2018-10-16 14:39:57 +08:00
wangzheng0822
4e0649eee5
Merge pull request #70 from RichardWeiYang/master
11_sorts: more tight boundary for selectionSort() and remove minValue
2018-10-16 10:46:42 +08:00
Wei Yang
be96922020 11_sorts: more tight boundary for selectionSort() and remove minValue
It is for sure a[i] == a[j], when i == j. So we could skip those cases.

And minValue could be represented by a[minIndex], so replace minValue
with a[minIndex].

Signed-off-by: Wei Yang <richard.weiyang@gmail.com>
2018-10-16 02:10:12 +08:00
Rain Liu
e6acab7a1a Other sort algorithms: bubbleDown and shell sort 2018-10-16 01:09:21 +08:00
carlos
bc3b4e3510 合并原始代码主干
合并原始代码主干
2018-10-15 11:05:22 +08:00
wangzheng
35f6a3a911 fix bug. 2018-10-15 10:09:49 +08:00
wangzheng
46266da8ec 11_sorts 2018-10-14 19:36:24 +08:00