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

fix(guide): Fixed broken formatting and links (#28958)

Browse Source
This commit is contained in:
Joe Roland
2019-01-21 12:43:20 -05:00
committed by Tom
parent a56ff7c3bf
commit 3cd7f55fcc
1 changed files with 5 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
guide/english/miscellaneous/freecodecamp-algorithm-binary-search-guide/index.md
View File

@ -15,7 +15,7 @@ Binary search works on sorted arrays. A binary search begins by comparing the mi
The pseudocode for binary search algorithm is as follows: The pseudocode for binary search algorithm is as follows:
BinarySearch(A<a href='https://repl.it/CWZq/158' target='_blank' rel='nofollow'>0..N-1], value) { BinarySearch(A[0..N-1], value) {
low = 0 low = 0
high = N - 1 high = N - 1
while (low <= high) { while (low <= high) {
@ -55,7 +55,9 @@ The pseudocode for binary search algorithm is as follows:
return -1; return -1;
} }
:rocket: [Run Code</a> ## Python Implementation ![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") <a href='https://repl.it/CWZq/158' target='_blank' rel='nofollow'>Run Code</a>
## Python Implementation
def binary_search(l, value): def binary_search(l, value):
low = 0 low = 0
@ -67,4 +69,4 @@ The pseudocode for binary search algorithm is as follows:
else: return mid else: return mid
return -1 return -1
![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") <a href='https://repl.it/CWZi/2' target='_blank' rel='nofollow'>Run Code</a> ![:rocket:](https://forum.freecodecamp.com/images/emoji/emoji_one/rocket.png?v=3 ":rocket:") <a href='https://repl.it/CWZi/2' target='_blank' rel='nofollow'>Run Code</a>