Bubble method Sorting

The idea of the foaming method is: Compare the adjacent two numbers, and the small one to the front.

It can be inferred that if there are n numbers, then the (n-1) wheel is compared and exchanged. In the first round to carry out (n-1) 22 comparison, in the J-Wheel to carry out (n-j) times 22 comparison.

The following 10 numbers are sorted from small to large:

#include <iostream>using namespace Std;int main () {int a[11];int I, J, t;cout<< "input numbers:\n"; for (I=1; i<11; i++) {cin>>a[i];} Cout<<endl;for (j=1; j<=9; J + +) {for (i=1; i<=10-j; i++) {if (A[i] > A[i+1]) {t = a[i];a[i] = a[i+1];a[i+1] = t;}}} cout<< "the sorted numbers: \ n"; for (I=1; i<11; i++) {Cout<<a[i]<<endl;} Cout<<endl;return 0;}

Bubble method Sorting