Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 469b014

Browse files
committed
Update 03.Array-Insertion-Sort.md
1 parent 837073b commit 469b014

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎Contents/01.Array/02.Array-Sort/03.Array-Insertion-Sort.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
>
55
> 将整个序列分为两部分:前面 `i` 个元素为有序序列,后面 `n - i` 个元素为无序序列。每一次排序,将无序序列的第 `1` 个元素,在有序序列中找到相应的位置并插入。
66
7-
简单来说,「选择排序算法」是在每一趟排序中,将无序序列的第 `1` 个元素,插入到有序序列的适当位置上。
7+
简单来说,「插入排序算法」是在每一趟排序中,将无序序列的第 `1` 个元素,插入到有序序列的适当位置上。
88

99
## 2. 插入排序算法步骤
1010

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /