摘要：
快速插入排序public InsertSort() { int[] a = { 12, 32, 34, 2, 3, 4, 54, 234, 6, 65, 34, 2, 3, 534, 6 }; int temp = 0; for (int i = 1; i < a.length; i++) { int j = i - 1; temp = a[i]; for (; j >= 0 && temp < a[j]; j--) ... 阅读全文
posted @ 2012-08-16 18:58
园林鸟
阅读(332)
评论(0)
推荐(0)
浙公网安备 33010602011771号