冒泡排序
public class Sort {
public static void main(String[] args) {
Sort s = new Sort();
int[] arr = {1,5,4,2,3};
s.sort(arr);
for (int i : arr) {
System.out.println(i);
}
}
public void sort(int[] arr){
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr.length-1-i; j++) {
if (compare(arr[j],arr[j+1])){
change(arr,j,j+1);
}
}
}
}
public boolean compare(int a,int b){
if (a > b)return true;
return false;
}
public void change(int[] arr ,int aIndex ,int bIndex){
int temp = arr[aIndex];
arr[aIndex] = arr[bIndex];
arr[bIndex] = temp;
}
}