插入排序
选一个数据作为有序,把无序的数据依次与有序比较排序,直至排序完成
public class InsertSort {
public static void main(String[] args) {
int[] nums = {3, 11, 4, 25, 26, 20};
int[] insertSort = method.insertSort(nums);
System.out.println(Arrays.toString(insertSort));
}
}
//从小到大排序
class method {
public static int[] insertSort(int[] nums) {
for (int i = 1; i < nums.length; i++) {
for (int j = i - 1; j >= 0; j--) {
if (nums[j] > nums[j + 1]) {
int temp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = temp;
}
}
}
return nums;
}
}
排序结果:
[3, 4, 11, 20, 25, 26]