------------------Learning bubble sorting algorithm come with me----------------

Learn this overall sentence: The outer end needs to reduce one, the inner end minus I minus one,

The Da Lei algorithm makes comparisons, comparing J and J+1,

If you do not want to report abnormal, must not have an equal sign.

Bubble sort
public static void Main (string[] args) {
int num []={18,200,27,198,190,175};
The array arrangement before sorting.
for (int i = 0; i < num.length; i++) {
System.out.println (Num[i]);
}
Compare the number of neighbors, who are big in the back,
for (int i = 0; i < num.length-1; i++) {
for (int j = 0; J < Num.length-i-1; J + +) {

Swap position (Daleitai)
if (Num[j]>num[j+1]) {
int TEMP=NUM[J];
NUM[J]=NUM[J+1];
Num[j+1]=temp;
}

}
}
for (int i = 0; i < num.length; i++) {
System.out.println ("Sorted array of permutations:" +num[i]);
}

}

}

------------------Learning bubble sorting algorithm come with me----------------