@ Bubble sort: comparing adjacent elements, a former than the latter if a large exchange O (N2)
public void bubbleSort () {
int [] = {3,6,34,12,56,37,54 ARR , 89,23};
for (int I = 0; I <arr.length; I ++) {
for (int I = J +. 1; J <arr.length; J ++) {
IF (ARR [I]> ARR [J ]) {
int ARR TEMP = [I];
ARR [I] = ARR [J];
ARR [J] = TEMP;
}
}
}
for (int I = 0; I <arr.length; I ++) {
the System.out .print (ARR [I] + ",");
}
}
// selection sort: each select the smallest, a location in 1,2,3 sequentially switched O (N2)
public void SelectionSort () {
int [] = {3,6,34,12,56,37 ARR , 54,89,23};
int In Flag = 0;
int TEMP = 0;
for (int I = 0; I <arr.length; I ++) {
TEMP = ARR [I];
In Flag = I;
for (int J = +. 1 I; J <arr.length; J ++) {
IF (ARR [J] <TEMP) {
TEMP = ARR [J];
in Flag = J;
}
} // the minimum data exchange
if (flag = i)! {
ARR [In Flag] = ARR [I];
ARR [I] = TEMP;
} // once every sort, once output
for (int A = 0; A <arr.length; A ++) {
System.out.print(arr[a]+",");
}
System.out.println();
}
}
//插入排序
public void insertSort() {
int[] arr = {3, 2, 34, 12, 56, 37, 54, 89, 23};
for (int i=1 ;i<arr.length;i++){
int temp=arr[i];
int j=i-1;
for (;j>=0;j--){
if(arr[j]>temp){
arr[j+1]=arr[j];
}
else{break;}
}
if(arr[i]!=temp){
arr[j+1]=temp;
}
for (int a=0;a<arr.length;a++){
System.out.print(arr[a]+",");
}
System.out.println();
}
}