public class Main { static int[] nums = {1,4,5,7,3,4,2,1,}; public static void main(String[] args) { // qksort(nums,0,nums.length-1); insertSort(nums); for(int x:nums){ System.out.print(x+ " "); } System.out.println(); } public static void qksort(int[] nums,int i,int j){ int start = i; int end = j; if(start>end)return; int baseNumber = nums[i]; while(start!=end){ while(true){ if(end<=start||nums[end]<baseNumber){ break; } end--; } while(start!=end){ if(end<=start||nums[start]>baseNumber){ break; } start++; } int temp = nums[start]; nums[start] = nums[end]; nums[end] = temp; } int temp = nums[i]; nums[i] = nums[start]; nums[start] = temp; qksort(nums,i,start-1); qksort(nums,start+1,j); } public static void insertSort(int[] nums){ int startIndex = 0; for(int i=0;i<nums.length-1;i++){ if(nums[i]>nums[i+1]){ startIndex = i+1; break; } } for(int i=startIndex;i<nums.length;i++){ int j=i; while(j>0&&nums[j]<nums[j-1]){ int t = nums[j]; nums[j] = nums[j-1]; nums[j-1] = t; j--; } } } }
快速排序&&插入排序
最新推荐文章于 2024-08-15 16:09:23 发布
![](https://img-home.csdnimg.cn/images/20240711042549.png)