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