Algorithm---bubble sorting method

Bubble Sort:

By comparing the adjacent elements and exchanging positions, a step-by-step selection of an element is made.

We can use a two-layer nested for loop to implement this process, that is, to implement a bubbling sort:

Outer control wheel number for (Var i=0;i<len;i++) {//inner layer array element to bubble Select for (Var j=0;j<len-1-i;j++) {//interactive element if (Arr[j] > arr[j+1]) {　　　　var temp = arr[j];　　　　ARR[J] = arr[j+1];　　　　ARR[J+1] = temp;    }　　}}

The following is the full code for the bubbling sort.

<! DOCTYPE HTML PUBLIC "-//W3C//DTD XHTML 1.0 transitional//en" "Http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd ">
　
Algorithm---bubble sorting method