algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2026-03-13 15:21:15 +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

16
Maths/BisectionMethod.js
View File

@@ -18,19 +18,26 @@ const findRoot = (a, b, func, numberOfIterations) => {
const res = f(x)
return !Number.isNaN(res)
}
if (!belongsToDomain(a, func) || !belongsToDomain(b, func)) throw Error("Given interval is not a valid subset of function's domain")
if (!belongsToDomain(a, func) || !belongsToDomain(b, func))
throw Error("Given interval is not a valid subset of function's domain")
// Bolzano theorem
const hasRoot = (a, b, func) => {
return func(a) * func(b) < 0
}
if (hasRoot(a, b, func) === false) { throw Error('Product f(a)*f(b) has to be negative so that Bolzano theorem is applied') }
if (hasRoot(a, b, func) === false) {
throw Error(
'Product f(a)*f(b) has to be negative so that Bolzano theorem is applied'
)
}
// Declare m
const m = (a + b) / 2
// Recursion terminal condition
if (numberOfIterations === 0) { return m }
if (numberOfIterations === 0) {
return m
}
// Find the products of f(m) and f(a), f(b)
const fm = func(m)
@@ -39,7 +46,8 @@ const findRoot = (a, b, func, numberOfIterations) => {
// Depending on the sign of the products above, decide which position will m fill (a's or b's)
if (prod1 > 0 && prod2 < 0) return findRoot(m, b, func, --numberOfIterations)
else if (prod1 < 0 && prod2 > 0) return findRoot(a, m, func, --numberOfIterations)
else if (prod1 < 0 && prod2 > 0)
return findRoot(a, m, func, --numberOfIterations)
else throw Error('Unexpected behavior')
}