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

Fixed the binary search equation by changing the 2x to 2^x (#21389)

Browse Source 
Fixed the binary search equation by changing the 2x to 2^x

If we divide N by 2 x times it is supposed to be N/2^x not N/2x
This commit is contained in:
vgupta3
2018-11-10 13:18:35 +05:30
committed by Huyen Nguyen
parent d6bf654355
commit 70fc1ac009
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -26,19 +26,19 @@ for small sets linear search is better but in larger ones it is way more efficie
In detail, how many times can you divide N by 2 until you have 1? This is essentially saying, do a binary search (half the elements) until you found it. In a formula this would be this: In detail, how many times can you divide N by 2 until you have 1? This is essentially saying, do a binary search (half the elements) until you found it. In a formula this would be this:
``` ```
1 = N / 2x 1 = N / 2^x
``` ```
Multiply by 2x: Multiply by 2<sup>x</sup>:
``` ```
2x = N 2^x = N
``` ```
Now do the log2: Now do the log2:
``` ```
log2(2x) = log2 N log2(2^x) = log2 N
x * log2(2) = log2 N x * log2(2) = log2 N
x * 1 = log2 N x * 1 = log2 N
``` ```