2016 Update
This commit is contained in:
parent
948b86eafa
commit
dcf5d15da3
7965 changed files with 139854 additions and 31002 deletions
|
|
@ -0,0 +1,34 @@
|
|||
// Node 5.4.1 tested implementation (ES6)
|
||||
"use strict";
|
||||
|
||||
let arr = [4, 9, 0, 3, 1, 5];
|
||||
let isSorted = true;
|
||||
while (isSorted){
|
||||
for (let i = 0; i< arr.length - 1;i++){
|
||||
if (arr[i] > arr[i + 1])
|
||||
{
|
||||
let temp = arr[i];
|
||||
arr[i] = arr[i + 1];
|
||||
arr[i+1] = temp;
|
||||
isSorted = true;
|
||||
}
|
||||
}
|
||||
|
||||
if (!isSorted)
|
||||
break;
|
||||
|
||||
isSorted = false;
|
||||
|
||||
for (let j = arr.length - 1; j > 0; j--){
|
||||
if (arr[j-1] > arr[j])
|
||||
{
|
||||
let temp = arr[j];
|
||||
arr[j] = arr[j - 1];
|
||||
arr[j - 1] = temp;
|
||||
isSorted = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
console.log(arr);
|
||||
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue