public static void main(String[] args) {
int[] it = {4,11,6,23,222,1,111,43,3,153,2,22};
for (int i = 0; i < it.length; i++) {
for (int j = 0; j < it.length - i -1; j++) {
if(it[j]>it[j+1]){
int s = it[j+1];
it[j+1] = it[j];
it[j] =s;
}
}
}
System.out.println("冒泡排序后:"+ Arrays.toString(it));
int[] nums={11,24,5,32,50,34,54,76};
quickSort(nums,0,nums.length-1);
System.out.println("快速排序后:"+ Arrays.toString(nums));
}
public static void quickSort(int[] nums, int start, int end){
if(start>end) return;
int i,j,base;
i=start;
j=end;
base=nums[start];
while (i<j){
while (i<j && nums[j]>=base) j--;
while (i<j && nums[i]<=base) i++;
if(i<j){
swap(nums,i,j);
}
}
swap(nums,start,i);
quickSort(nums,start,j-1);
quickSort(nums,j+1,end);
}
public static void swap(int[] nums,int left,int right){
int temp=nums[left];
nums[left]=nums[right];
nums[right]=temp;
}
冒泡和快速
最新推荐文章于 2024-07-13 13:55:40 发布