冒泡排序
import java.util.*; public class Solution { public int[] MySort (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+1]; arr[j+1] = arr[j]; arr[j] = temp; } } } return arr; } }