冒泡排序 // 比如:升序,int [] arr={12,2,4,24,1,56,52,53,84,6}; int [] arr={12,2,4,24,1,56,52,53,84,6}; int min=arr[0]; for (int j = 0; j < arr.length-1; j++) { for (int i = 0; i < arr.length-1; i++) { if(arr[i+1]<arr[i]) { int t = arr[i]; arr[i] = arr[i+1]; arr[i+1]= t; } } }
初学Java之冒泡排序
最新推荐文章于 2024-07-25 11:43:17 发布