feat: 二分查找-bobo

Author: sl1673495

.prettierrc

@@ -1,3 +1,4 @@
 {
-  "printWidth": 140
+  "printWidth": 140,
+  "tabWidth": 2
 }

算法-bobo老师版本/二分查找.js

@@ -0,0 +1,21 @@
+function binarySearch(arr, n, target) {
+  // 在[l...r]的范围里寻找target
+  let l = 0;
+  let r = n - 1;
+  while (l <= r) {
+    let mid = Math.round((l + r) / 2);
+
+    if (arr[mid] === target) {
+      return mid;
+    }
+
+    if (target > arr[mid]) {
+      l = mid + 1; // 在[mid+1...r]的范围里寻找target
+    } else {
+      r = mid - 1;
+    }
+  }
+  return -1;
+}
+
+console.log(console.log(binarySearch([1, 2, 3, 4, 5], 5, 2)));