From e68cb18e35cf21b164e22f14d50d9072f2666454 Mon Sep 17 00:00:00 2001
From: chensiquan <40712868+SiQuan77@users.noreply.github.com>
Date: Thu, 22 Sep 2022 15:40:30 +0800
Subject: [PATCH] =?UTF-8?q?=E5=B8=8C=E5=B0=94=E6=8E=92=E5=BA=8F=E7=9A=84?=
 =?UTF-8?q?=E7=A9=BA=E9=97=B4=E5=A4=8D=E6=9D=82=E5=BA=A6=E6=9C=89=E8=AF=AF?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

希尔排序的空间复杂度应该是O（1）吧，并没有用到额外的空间，都是在原数组上进行操作。
---
 docs/cs-basics/algorithms/10-classical-sorting-algorithms.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/cs-basics/algorithms/10-classical-sorting-algorithms.md b/docs/cs-basics/algorithms/10-classical-sorting-algorithms.md
index 81bd68a5..9c4e1eb6 100644
--- a/docs/cs-basics/algorithms/10-classical-sorting-algorithms.md
+++ b/docs/cs-basics/algorithms/10-classical-sorting-algorithms.md
@@ -259,7 +259,7 @@ public static int[] shellSort(int[] arr) {
 
 - **稳定性**：稳定
 - **时间复杂度** ：最佳：O(nlogn)， 最差：O(n2) 平均：O(nlogn)
-- **空间复杂度** ：`O(n)`
+- **空间复杂度** ：`O(1)`
 
 ## 归并排序 (Merge Sort)