Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Merge pull request #380 from wangxujian-laixuzhui/patch-1

Browse Source 
选择不稳定，如2，2，1，第一个2会和1交换
This commit is contained in:
郑永川 2018-08-21 19:53:40 +08:00 committed by GitHub
commit ab315f1da3
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notes/算法.md
View File

@ -770,7 +770,7 @@ public class HeapSort<T extends Comparable<T>> extends Sort<T> {
| 算法 | 稳定 | 时间复杂度 | 空间复杂度 | 备注 |
| :---: | :---: |:---: | :---: | :---: |
| 选择排序 | √| N<sup>2</sup> | 1 | |
| 选择排序 | ×| N<sup>2</sup> | 1 | |
| 冒泡排序 | √ | N<sup>2</sup> | 1 | |
| 插入排序 | √ | N \~ N<sup>2</sup> | 1 | 时间复杂度和初始顺序有关 |
| 希尔排序 | × | N 的若干倍乘于递增序列的长度 | 1 | |