We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 438d6ad commit 7a3ce7cCopy full SHA for 7a3ce7c
src/Searching/BinarySearch/index.js
@@ -23,14 +23,14 @@ function binarySearch(arr, key) {
23
function binarySearchRecursive(arr, low, high, key) {
24
const mid = Math.floor((high - low) / 2 + low);
25
26
- if (high < low) {
+ if (high <= low && arr[mid] !== key) {
27
return null;
28
+ } else if (key === arr[mid]) {
29
+ return mid;
30
} else if (key < arr[mid]) {
31
return binarySearchRecursive(arr, low, mid - 1, key);
32
} else if (key > arr[mid]) {
33
return binarySearchRecursive(arr, mid + 1, high, key);
- } else if (key === arr[mid]) {
- return mid;
34
}
35
36
0 commit comments