Address review edge cases in meta binary search

Author: nickzerjeski

Search/MetaBinarySearch.js

@@ -12,11 +12,11 @@ function metaBinarySearch(sortedArray, target) {
   }
 
   const n = sortedArray.length
-  const maxBit = Math.floor(Math.log2(n - 1 < 0 ? 0 : n - 1))
+  const maxBit = Math.floor(Math.log2(Math.max(1, n - 1)))
 
   let position = 0
   for (let bit = maxBit; bit >= 0; bit--) {
-    const candidate = position | (1 << bit)
+    const candidate = position + 2 ** bit
     if (candidate < n && sortedArray[candidate] <= target) {
       position = candidate
     }

Search/test/MetaBinarySearch.test.js

@@ -18,4 +18,8 @@ describe('Meta Binary Search', () => {
   test('returns -1 on empty input', () => {
     expect(metaBinarySearch([], 1)).toBe(-1)
   })
+
+  test('returns index for a matching element in a single-element array', () => {
+    expect(metaBinarySearch([7], 7)).toBe(0)
+  })
 })