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

Added best case time complexity (#25511)

Browse Source 
Added best case time complexity along with the best case condition in the time complexity section.
This commit is contained in:
Sameer Bhardwaj
2018-12-05 10:02:02 +05:30
committed by Aditya
parent 12529624c1
commit 17e712324a
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -18,6 +18,7 @@ Because we know that names in the phonebook are sorted alphabetically, we could
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
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*).
Space complexity: Binary search takes constant or *O*(*1*) space meaning that we don't do any input size related variable defining. Space complexity: Binary search takes constant or *O*(*1*) space meaning that we don't do any input size related variable defining.