// The Bubble sort algorithm

// Definition

// Bubble sort is a simple sorting algorithm that repeatedly steps through the list to be sorted,

// compares each pair of adjacent items and swaps them if they are in the wrong order.

// The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted.

// From Wikipedia

// swap function helper

function swap(array, i, j) {

var temp = array[i];

array[i] = array[j];

array[j] = temp;

}

// be careful: this is a very basic implementation which is nice to understand the deep principle of bubble sort (going through all comparisons) but it can be greatly improved for performances

function bubbleSortBasic(array) {

for(var i = 0; i < array.length; i++) {

for(var j = 1; j < array.length; j++) {

if(array[j - 1] > array[j]) {

swap(array, j - 1, j);

}

}

}

return array;

}

console.log(bubbleSortBasic(array.slice())); // => [ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ]