public class Test33{
public static void main(String[] args){
int[] sort = new int[]{32,26,67,56,90,13}; //待排序的数列
int len = sort.length;
for(int i=0;i<len-1;i++){ //遍历的趟数
for(int j=0;j<len-1-i;j++){ //每趟遍历的次数
if(sort[j]>sort[j+1]){
sort[j] = sort[j] + sort[j+1]; //交换两数的值算法
sort[j+1] = sort[j] - sort[j+1];
sort[j] = sort[j] - sort[j+1];
}
}
}
for(int x : sort) //输出排序后的数列
System.out.print(x+" ");
System.out.println();
}
}
运行结果:
另:
public class maopaopaixu {
public static void main(String[] args) {
int[] nums = {23,12,45,34,67,14,55,18};
for (int i=1;i<nums.length;i++){
for (int j= 1;j<=nums.length-i;j++){
if (nums[j-1]>nums[j]){
nums[j-1]=nums[j-1]^nums[j];
nums[j]=nums[j-1]^nums[j];
nums[j-1]=nums[j-1]^nums[j];
}
}
}
for (int num : nums) {
System.out.print(num+" ");
}
}
}
运行结果: