算法
文章平均质量分 75
jane_fast
梦很大的梦想家
展开
-
快排(JAVA实现)
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};原创 2017-04-23 12:44:50 · 5636 阅读 · 0 评论 -
希尔排序(JAVA实现)
/** * 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,原创 2017-04-23 15:26:40 · 383 阅读 · 0 评论 -
直接插入排序(JAVA实现)
/** * 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;原创 2017-04-23 15:42:22 · 262 阅读 · 0 评论 -
二路归并(JAVA实现)
/** * 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原创 2017-04-24 00:58:25 · 1536 阅读 · 1 评论