GeezerVison is showing github.com — JavaScript/Maths/FindMaxRecursion.js at master · TheAlgorithms/JavaScript

Expand file tree

FindMaxRecursion.js

Copy path

More file actions

42 lines (35 loc) · 1.15 KB

Copy path

42 lines (35 loc) · 1.15 KB

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

/**

* @function findMaxRecursion

* @description This algorithm will find the maximum value of a array of numbers.

* @param {Integer[]} arr Array of numbers

* @param {Integer} left Index of the first element

* @param {Integer} right Index of the last element

* @return {Integer} Maximum value of the array

* @see [Maximum value](https://en.wikipedia.org/wiki/Maximum_value)

* @example findMaxRecursion([1, 2, 4, 5]) = 5

* @example findMaxRecursion([10, 40, 100, 20]) = 100

* @example findMaxRecursion([-1, -2, -4, -5]) = -1

function findMaxRecursion(arr, left, right) {

const len = arr.length

if (len === 0 || !arr) {

return undefined

}

if (left >= len || left < -len || right >= len || right < -len) {

throw new Error('Index out of range')

}

if (left === right) {

return arr[left]

}

// n >> m is equivalent to floor(n / pow(2, m)), floor(n / 2) in this case, which is the mid index

const mid = (left + right) >> 1

const leftMax = findMaxRecursion(arr, left, mid)

const rightMax = findMaxRecursion(arr, mid + 1, right)

// Return the maximum

return Math.max(leftMax, rightMax)

}

export { findMaxRecursion }