JavaScript Bubble Sort Algorithm Details _ basics

Compare the adjacent elements. If the first one is bigger than the second one, swap them both.
Do the same work for each pair of adjacent elements, from the first pair to the end of the last couple. At this point, the final element should be the largest number.
Repeat the above steps for all elements except the last one.
Continue to repeat the previous steps for less and fewer elements until no pair of digits need to be compared.

Copy Code code as follows:

function sort (elements) {
for (Var i=0;i<elements.length-1;i++) {
for (Var j=0;j<elements.length-i-1;j++) {
if (Elements[j]>elements[j+1]) {
var swap=elements[j];
ELEMENTS[J]=ELEMENTS[J+1];
Elements[j+1]=swap;
}
}
}
}

var elements = [3, 1, 5, 7, 2, 4, 9, 6, 10, 8];
Console.log (' before: ' + elements);
Sort (elements);
Console.log (' after: ' + elements);

Efficiency:

Time complexity: Best: O (N), Worst: O (n^2), average: O (n^2).

Complexity of Space: O (1).

Stability: stability.