algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 17:50:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Test running overhaul, switch to Prettier & reformat everything (#1407)

Browse Source 
* chore: Switch to Node 20 + Vitest

* chore: migrate to vitest mock functions

* chore: code style (switch to prettier)

* test: re-enable long-running test

Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime!

see #1193

* chore: code style

* chore: fix failing tests

* Updated Documentation in README.md

* Update contribution guidelines to state usage of Prettier

* fix: set prettier printWidth back to 80

* chore: apply updated code style automatically

* fix: set prettier line endings to lf again

* chore: apply updated code style automatically

---------

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
This commit is contained in:
Roland Hummel
2023-10-03 23:08:19 +02:00
committed by GitHub
parent 0ca18c2b2c
commit 86d333ee94
392 changed files with 5849 additions and 16622 deletions
Download Patch File Download Diff File Expand all files Collapse all files

84
Maths/FindMaxRecursion.js
View File

@ -1,42 +1,42 @@
/**
* @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 }
/**
* @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 }