yaclty/Java-Interview-Guide
1
0
Fork 0
mirror of https://github.com/Snailclimb/JavaGuide synced 2025-08-01 16:28:03 +08:00
Code Issues Projects Releases Wiki Activity

希尔排序的空间复杂度有误

Browse Source 
希尔排序的空间复杂度应该是O（1）吧，并没有用到额外的空间，都是在原数组上进行操作。
This commit is contained in:
chensiquan 2022-09-22 15:40:30 +08:00 committed by GitHub
parent 8379c0bf77
commit e68cb18e35
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
docs/cs-basics/algorithms/10-classical-sorting-algorithms.md
View File

@ -259,7 +259,7 @@ public static int[] shellSort(int[] arr) {
- **稳定性**：稳定
- **时间复杂度** ：最佳：O(nlogn)， 最差：O(n2) 平均：O(nlogn)
- **空间复杂度** ：`O(n)`
- **空间复杂度** ：`O(1)`
## 归并排序 (Merge Sort)