mirror of
https://github.com/adambard/learnxinyminutes-docs.git
synced 2025-01-14 13:15:59 +00:00
Add missing space. (#2356)
This commit is contained in:
parent
66c8b036dc
commit
a00c47f701
@ -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
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user