冒泡排序
class MaoPao{
public static void maoPao(int[] arr){
for (int i=0;i<arr.length-1;i++ ){
for (int j=0;j<arr.length-i-1 ;j++ ){
if (arr[j]>arr[j+1]){
int temp=arr[j];
arr[j]=arr[j+1];
arr[j+1]=temp;
}
}
}
}
public static void main(String[] args){
int[] arr={1,4,3,5,7,6,2};
maoPao(arr);
for (int x=0;x<arr.length ;x++ ){
System.out.println(arr[x]);
}
}
}
选择排序
class XuanZe {
public static void sort(int[] arr){
for (int i=0;i<arr.length ;i++ ){
for (int j=i+1;j<arr.length ;j++ ){
if(arr[i]>arr[j]){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
}
public static void main(String[] args){
int[] arr = {1,4,6,3,5,8,7,0,-2};
sort(arr);
for (int i=0;i<arr.length ;i++ ){
System.out.print(arr[i] +" ");
}
}
}