Skip to content

修正错别字 #39

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
asukaminato0721 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

修正错别字 #39

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
2 changes: 1 addition & 1 deletion book/chpt_21_analysis_of_algorithms.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -589,7 +589,7 @@ \section{搜索算法分析}
%🍁% first half of the sequence. Otherwise you search the second half.
%🍁% Either way, you cut the number of remaining items in half.

如果元素在序列中是排序好的，你可以用 {\em 二分搜素} (bisection search) ，
如果元素在序列中是排序好的，你可以用 {\em 二分搜索} (bisection search) ，
它的增长量级是 $O(\log n)$ 。 二分搜索和你在字典中查找一个单词的算法类似
（这里是指真正的字典，不是数据结构）。 你不会从头开始并按顺序检查每个项，
而是从中间的项开始并检查你要查找的单词在前面还是后面。
Expand Down