选择排序

// 我就从所有序列中先找到最小的，然后放到第一个位置。// 之后再看剩余元素中最小的，放到第二个位置……以此类推，就可以完成整个的排序工作了。private static void sort(int v[]) {v = Tools.getAry(v);for (int i = 0; i < v.length; i++) {int min = v[i];int temp;int index = i;for (int j = i + 1; j < v.length; j++) {if (v[j] < min) {min = v[j];index = j;}}temp = v[i];v[i] = min;v[index] = temp;System.out.println(Tools.convertAry(v));}}

sort before[4, 3, 5, 10, 6, 8, 13, 7, 1, 13][1, 3, 5, 10, 6, 8, 13, 7, 4, 13][1, 3, 5, 10, 6, 8, 13, 7, 4, 13][1, 3, 4, 10, 6, 8, 13, 7, 5, 13][1, 3, 4, 5, 6, 8, 13, 7, 10, 13][1, 3, 4, 5, 6, 8, 13, 7, 10, 13][1, 3, 4, 5, 6, 7, 13, 8, 10, 13][1, 3, 4, 5, 6, 7, 8, 13, 10, 13][1, 3, 4, 5, 6, 7, 8, 10, 13, 13][1, 3, 4, 5, 6, 7, 8, 10, 13, 13][1, 3, 4, 5, 6, 7, 8, 10, 13, 13]