import java.util.Arrays;
public class ArraysSort {
public static void main(String[] args) {
int [] arr={3,4,-5,7,1,2};
int [] arr1=arrSort(arr);
System.out.println(Arrays.toString(arr1));
}
public static int[] arrSort(int[] arr) {
if (arr == null || arr.length < 2) {
return arr;
}
int n = arr.length;
for (int i = 0; i < n; i++) {
boolean flag = true;
for (int j = 0; j < n -i - 1; j++) {
if (arr[j + 1] < arr[j]) {
flag = false;
int t = arr[j];
arr[j] = arr[j+1];
arr[j+1] = t;
}
}
//如果第一次循环,位置都没交换,证明已经是升序排列了,直接跳出循环
if(flag)
break;
}
return arr;
}
}