摘要:
代码public class QuickSort { public static int[] QuickSort0(int[] pData, int left, int right) { int i= left, j= right; int middle, strTemp; middle = pData[(left + right) / 2]; do { while ((pData[i] middle) && (i right)) i++; while ((pData[j] middle) && (j left)) j--; if (i = j) { strTemp
阅读全文
posted @ 2010-12-17 08:30
wblade
阅读(277)
推荐(0)
编辑