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

8
Sorts/SelectionSort.js
View File

@@ -20,15 +20,17 @@ export const selectionSort = (list) => {
}
// Number of passes
let min = i // min holds the current minimum number position for each pass; i holds the Initial min number
for (let j = i + 1; j < length; j++) { // Note that j = i + 1 as we only need to go through unsorted array
if (items[j] < items[min]) { // Compare the numbers
for (let j = i + 1; j < length; j++) {
// Note that j = i + 1 as we only need to go through unsorted array
if (items[j] < items[min]) {
// Compare the numbers
min = j // Change the current min number position if a smaller num is found
}
}
if (min !== i) {
// After each pass, if the current min num != initial min num, exchange the position.
// Swap the numbers
[items[i], items[min]] = [items[min], items[i]]
;[items[i], items[min]] = [items[min], items[i]]
}
}
return items