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

* 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

View File

@ -6,8 +6,9 @@
* Wikipedia: https://en.wikipedia.org/wiki/Flashsort
*/
export function flashSort (arr) {
let max = 0; let min = arr[0]
export function flashSort(arr) {
let max = 0
let min = arr[0]
const n = arr.length
const m = ~~(0.45 * n)
const l = new Array(m)
@ -45,12 +46,14 @@ export function flashSort (arr) {
arr[0] = hold
// permutation
let move = 0; let t; let flash
let move = 0
let t
let flash
let j = 0
let k = m - 1
while (move < (n - 1)) {
while (j > (l[k] - 1)) {
while (move < n - 1) {
while (j > l[k] - 1) {
++j
k = ~~(c1 * (arr[j] - min))
}
@ -58,7 +61,7 @@ export function flashSort (arr) {
flash = arr[j]
while (j !== l[k]) {
k = ~~(c1 * (flash - min))
hold = arr[t = --l[k]]
hold = arr[(t = --l[k])]
arr[t] = flash
flash = hold
++move
@ -78,7 +81,7 @@ export function flashSort (arr) {
}
/**
* Implementation of Flash Sort
*/
* Implementation of Flash Sort
*/
// const array = [3, 0, 2, 5, -1, 4, 1, -2]
// flashSort(array)