Skip to content

update 快速排序.md #27

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

Open
LuDamon wants to merge 1 commit into
base: master
Choose a base branch
from
Open

update 快速排序.md #27

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
4 changes: 2 additions & 2 deletions 算法集合/快速排序.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,8 +15,8 @@


当然现在这个地方讲 Partition 的话单纯是针对 快速排序，但是 Partition 的使用不仅仅仅限于此，举个例子如果我想查找一堆数中的第 K 大的数用 Partition 也是可以实现的，大致的思路如下：
- 随机找个一个数进行 Partion
- 将 Partion 操作之后的这个随机数的索引 +1 与 K 比较
- 随机找个一个数进行 Partiton
- 将 Partiton 操作之后的这个随机数的索引 +1 与 K 比较
- 如果比 K 小 则在右部分继续，否则在左部分继续，直到索引 +1 == K
（*以上默认排列顺序从左到右为从小到大*）

Expand Down