心有猛虎，细嗅蔷薇

private int[] selectSort(int[] nums) { int length = nums.length; for (int i = 0; i < length; i++) { for (int j = i; j < length; j++) { if (nums[j] < nums[i]) { int tmp = nums[i]; ...

public static int[] insertionSort(int nums) { for (int i = 0; i < nums.length; i++) { for (int j = i; j > 0; j--) { if (nums[j] < nums[j - 1]) { int tmp = nums[j - 1]; nums[j - ...

private int[] bubbleSort(int[] nums) { }