gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Add a gif showing binary search and linear search (#32384)

Browse Source
This commit is contained in:
ankur
2019-02-14 05:09:07 +05:30
committed by Randell Dawson
parent ee9920fbb8
commit 5181843c25
1 changed files with 2 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
guide/english/algorithms/search-algorithms/binary-search/index.md
View File

@ -17,6 +17,8 @@ Because we know that names in the phonebook are sorted alphabetically, we could
3. Otherwise, throw away the half of the phonebook that does not contain the name 3. Otherwise, throw away the half of the phonebook that does not contain the name
4. Repeat until you find the name or there are no more pages left in the phonebook 4. Repeat until you find the name or there are no more pages left in the phonebook
[![Binary vs Linear Search](https://www.mathwarehouse.com/programming/images/binary-vs-linear-search/binary-and-linear-search-animations.gif)]
Time complexity: As we dispose off one part of the search case during every step of binary search, and perform the search operation on the other half, this results in a worst case time complexity of *O*(*log<sub>2</sub>N*). Time complexity: As we dispose off one part of the search case during every step of binary search, and perform the search operation on the other half, this results in a worst case time complexity of *O*(*log<sub>2</sub>N*).
The best case occurs when the element to be found is in the middle of the list. The best case time complexity is *O*(*1*). The best case occurs when the element to be found is in the middle of the list. The best case time complexity is *O*(*1*).