We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent da7fc33 commit 0f83eafCopy full SHA for 0f83eaf
Maths/FindMaxRecursion.js
@@ -31,7 +31,7 @@ function findMaxRecursion (arr, left, right) {
31
32
// n >> m is equivalent to floor(n / pow(2, m)), floor(n / 2) in this case, which is the mid index
33
const mid = (left + right) >> 1
34
-
+
35
const leftMax = findMaxRecursion(arr, left, mid)
36
const rightMax = findMaxRecursion(arr, mid + 1, right)
37
0 commit comments