fix(guide): Fixed broken formatting and links (#28958)
This commit is contained in:
@ -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:
|
||||
|
||||
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
|
||||
high = N - 1
|
||||
while (low <= high) {
|
||||
@ -55,7 +55,9 @@ The pseudocode for binary search algorithm is as follows:
|
||||
return -1;
|
||||
}
|
||||
|
||||
:rocket: [Run Code</a> ## Python Implementation
|
||||
 <a href='https://repl.it/CWZq/158' target='_blank' rel='nofollow'>Run Code</a>
|
||||
|
||||
## Python Implementation
|
||||
|
||||
def binary_search(l, value):
|
||||
low = 0
|
||||
@ -67,4 +69,4 @@ The pseudocode for binary search algorithm is as follows:
|
||||
else: return mid
|
||||
return -1
|
||||
|
||||
 <a href='https://repl.it/CWZi/2' target='_blank' rel='nofollow'>Run Code</a>
|
||||
 <a href='https://repl.it/CWZi/2' target='_blank' rel='nofollow'>Run Code</a>
|
||||
|
Reference in New Issue
Block a user