Fury333999的博客

原创 三部排序

分为负0正这种 且每个区块内无需有序 static void sort(int[] x) { int p = 0; int left = 0; int right = x.length-1; while(p<=right){ if(x[p]<0){ int t = x[left]; x[left] = x[p]; x[p] ...