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

sorts/

Browse Source
This commit is contained in:
itsvinayak
2020-05-04 11:58:44 +05:30
parent 852563a2ec
commit 622ad9e41f
7 changed files with 108 additions and 104 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
Sorts/selectionSort.js
View File

@ -7,6 +7,7 @@
*In every iteration of selection sort, the minimum element (considering ascending order)
*from the unsorted subarray is picked and moved to the sorted subarray.
*/
function selectionSort (items) {
var length = items.length
for (var i = 0; i < length - 1; i++) {
@ -17,7 +18,7 @@ function selectionSort (items) {
min = j // Change the current min number position if a smaller num is found
}
}
if (min != i) {
if (min !== i) {
// After each pass, if the current min num != initial min num, exchange the position.
// Swap the numbers
var tmp = items[i]