Skip to content

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

Merged
Snailclimb merged 1 commit intoSnailclimb:mainfrom
SiQuan77:patch-1
Sep 23, 2022
Merged

希尔排序的空间复杂度有误#1830
Snailclimb merged 1 commit intoSnailclimb:mainfrom
SiQuan77:patch-1

Conversation

@SiQuan77
Copy link
Copy Markdown
Contributor

希尔排序的空间复杂度应该是O(1)吧,并没有用到额外的空间,都是在原数组上进行操作。

希尔排序的空间复杂度应该是O(1)吧,并没有用到额外的空间,都是在原数组上进行操作。
@Snailclimb Snailclimb merged commit 0ce0cb5 into Snailclimb:main Sep 23, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants