Java排序算法---冒泡排序
public class MaoPaoSort {
public static void MaoPaoSort(int nums[],int start,int end){
for(int i=0;i< nums.length-1;i++){
for(int j=0;j<nums.length-1-i;j++){
if(nums[j]>nums[j+1]){
int temp=nums[j];
nums[j]=nums[j+1];
nums[j+1]=temp;
}
}
}
}
public static void main(String[] args) {
int [] nums={2,9,121,32,33,555,11,78,99};
MaoPaoSort(nums,0, nums.length-1);
for (int i = 0; i < nums.length; i++) {
System.out.print(nums[i]+" ");
}
}
}
输出结果为:2 9 11 32 33 78 99 121 555