algorithm

algorithm

Insert Sort

Compare each element of the unordered array (original array) to each element of the ordered array. The first element of the original array is counted as the first element of the ordered array (notice that the outside loop starts from the second element, index 1). The ordered array is sorted

algorithm

Select Sort

Select Sort assumes the first element as the smallest and compares it to the rest elements of each pass. If it finds smaller, it sets the smallest with the smaller. Each pass fixes its smallest from the lowest index position. function selectSort(list) { for (i = 0; i < list.length-1; i+

algorithm

Bubble Sort

Bubble Sort compares two adjacent elements in each pass and re-array sorted elements from the highest index position. function bubbleSort(list) { var c = list.length-1; do { for(var i=0; i list[i+1]) { var t = list[i]; list[i] = list[i+1]; list[i+1] = t; } } c-=1 } while