Skip to content

[pull] main from itcharge:main #210

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 19, 2025
Merged

[pull] main from itcharge:main #210

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion docs/01_array/01_02_array_sort.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -68,4 +68,5 @@

## 5. 总结

选择合适的排序算法需要综合考虑数据特征、环境约束和性能要求。在实际开发中，大多数编程语言的标准库都提供了经过优化的排序函数，这些函数通常结合了多种排序算法的优点，能够适应不同的数据特征。
排序算法的核心目标是将数据按指定顺序排列。常见排序算法各有优缺点，选择时需结合数据规模、数据特性和实际需求。一般来说，小规模数据可用插入、冒泡等简单算法；大规模或高性能场景优先考虑快速排序、归并排序等高效算法。若有稳定性或空间限制等特殊要求，应优先选择满足条件的算法。理解各种排序的原理和适用场景，有助于在实际开发中做出最优选择。

2 changes: 1 addition & 1 deletion docs/01_array/01_13_array_binary_search_01.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -147,7 +147,7 @@ class Solution:

### 3.1 核心要点

**二分查找**是一种在**有序数组**中高效查找目标元素的算法，其核心思想是**每次将查找区间缩小一半**，从而快速定位目标位置。
**二分查找** 是一种在 **有序数组** 中高效查找目标元素的算法，其核心思想是 **每次将查找区间缩小一半**，从而快速定位目标位置。

### 3.2 算法特点

Expand Down