jane_fast的博客

import java.util.Scanner;/** * Created by DELL on 2017/4/22. * 快速排序 */public class KuaiSuSort { public static void main(String[] args){ int[] in = {54,45,87,12,95,56,32,15,0,25};

/** * Created by DELL on 2017/4/23. * 希尔排序 */public class ShellInsertSort { public static void main(String[] args){ // System.out.println("luan"); int[] in = {46,12,25,33,33,68,19,

/** * Created by DELL on 2017/4/23. * 直接插入排序 */public class InsertSort { public static void main(String[] args){ int[] in = {33,12,25,46,33,68,19,80}; int count = in.length;

/** * Created by DELL on 2017/4/23. * 二路归并 */public class ErLuGuiBInSort { public static void main(String[] args){ int[] in = {46,12,33,72,68,19,80,33}; int[] rein = new int[in