hxx/javascript-algorithms
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git synced 2024-11-10 11:09:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix gnome algorithm

Browse Source
This commit is contained in:
edumoreira1506 2019-09-10 14:18:06 -03:00
parent e1b38711dd
commit 5d9f19b184
1 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/algorithms/sorting/gnome-sort/GnomeSort.js
View File

@ -5,25 +5,30 @@ export default class GnomeSort extends Sort {
* @param {number[]} originalArray * @param {number[]} originalArray
*/ */
sort(originalArray) { sort(originalArray) {
const sortedArray = originalArray; const sortedArray = originalArray.map(element => element);
// Variable that will be itering during loop // Variable that will be itering during loop
let index = 0; let index = 0;
if (sortedArray.length <= 1) {
return sortedArray;
}
// Loop for sort the array // Loop for sort the array
while (index < originalArray.length) { while (index < sortedArray.length) {
// Detects the first iteration // Detects the first iteration
if (index === 0) { if (index === 0) {
index += 1; index += 1;
} }
// Detects if the current position is smaller of previous // Detects if the current position is smaller of previous
if (originalArray[index] >= originalArray[index - 1]) { if (sortedArray[index] >= sortedArray[index - 1]) {
index += 1; index += 1;
} else { } else {
// Change the position of current position for before // Change the position of current position for before
sortedArray[index] = originalArray[index - 1]; const temp = sortedArray[index];
sortedArray[index - 1] = originalArray[index]; sortedArray[index] = sortedArray[index - 1];
sortedArray[index - 1] = temp;
index -= 1; index -= 1;
} }
} }