diff options
| author | Baurzhan Muftakhidinov <baurthefirst@gmail.com> | 2016-09-05 12:42:02 +0500 |
|---|---|---|
| committer | ven <vendethiel@hotmail.fr> | 2016-09-05 09:42:02 +0200 |
| commit | a00c47f70141ee694eef7dabc54778d3c178607d (patch) | |
| tree | 42c8cc86d418f4bddb77518de668ac72b53675e5 /binary-search.html.markdown | |
| parent | 66c8b036dcdbcd538f914e14d073194d704159fa (diff) | |
Add missing space. (#2356)
Diffstat (limited to 'binary-search.html.markdown')
| -rw-r--r-- | binary-search.html.markdown | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/binary-search.html.markdown b/binary-search.html.markdown index 92df4875..ce436b44 100644 --- a/binary-search.html.markdown +++ b/binary-search.html.markdown @@ -9,7 +9,7 @@ contributors: ## Why Binary Search? -Searching is one of the prime problems in the domain of Computer Science.Today there are more than 1 trillion searches per year, and we need algorithms that can do that very fastly. Binary search is one of the fundamental algorithms in computer science. In order to explore it, we’ll first build up a theoretical backbone, then use that to implement the algorithm properly. +Searching is one of the prime problems in the domain of Computer Science. Today there are more than 1 trillion searches per year, and we need algorithms that can do that very fastly. Binary search is one of the fundamental algorithms in computer science. In order to explore it, we’ll first build up a theoretical backbone, then use that to implement the algorithm properly. ## Introduction |