diff --git a/posts/cpp-binary-search.md b/posts/cpp-binary-search.md
index cab6c65..2764d6c 100644
--- a/posts/cpp-binary-search.md
+++ b/posts/cpp-binary-search.md
@@ -30,7 +30,6 @@ Because of the ordering, you can rapidly narrow down the word you want.
 
 Computers can do the same with ordered data: this is called *binary search*,
 and is what powers `lower_bound` and `upper_bound`.
-Binary search is like searching for a word in the dictionary, but more structured.
 For example, say our dictionary is 1000 pages, and the computer wants to look for the word "rabbit".
 These are the steps it takes: