mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-18 01:05:42 +08:00
86d333ee94
* 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>
38 lines
894 B
JavaScript
38 lines
894 B
JavaScript
import { findRoot } from '../BisectionMethod'
|
|
|
|
test('Equation f(x) = x^2 - 3*x + 2 = 0, has root x = 1 in [a, b] = [0, 1.5]', () => {
|
|
const root = findRoot(
|
|
0,
|
|
1.5,
|
|
(x) => {
|
|
return Math.pow(x, 2) - 3 * x + 2
|
|
},
|
|
8
|
|
)
|
|
expect(root).toBe(0.9990234375)
|
|
})
|
|
|
|
test('Equation f(x) = ln(x) + sqrt(x) + π*x^2 = 0, has root x = 0.36247037 in [a, b] = [0, 10]', () => {
|
|
const root = findRoot(
|
|
0,
|
|
10,
|
|
(x) => {
|
|
return Math.log(x) + Math.sqrt(x) + Math.PI * Math.pow(x, 2)
|
|
},
|
|
32
|
|
)
|
|
expect(Number(Number(root).toPrecision(8))).toBe(0.36247037)
|
|
})
|
|
|
|
test('Equation f(x) = sqrt(x) + e^(2*x) - 8*x = 0, has root x = 0.93945851 in [a, b] = [0.5, 100]', () => {
|
|
const root = findRoot(
|
|
0.5,
|
|
100,
|
|
(x) => {
|
|
return Math.exp(2 * x) + Math.sqrt(x) - 8 * x
|
|
},
|
|
32
|
|
)
|
|
expect(Number(Number(root).toPrecision(8))).toBe(0.93945851)
|
|
})
|