数据结构
AdjGraph
这个作者很懒,什么都没留下…
展开
-
冒泡排序
冒泡排序 package com.athome.sorting; import java.util.*; public class Sort { public static void main(String[] args){ int[] arr = {13,9,8,25,98,63,5,0}; System.out.println("before: "+Arrays.toString(arr)); for(int i = 0;i < arr.leng原创 2020-06-27 11:52:35 · 190 阅读 · 0 评论 -
希尔排序
希尔排序 package com.athome.sorting; import java.util.*; public class Sort { public static void main(String[] args){ int[] arr = {13,9,8,25,98,63,5,0}; System.out.println("before: "+Arrays.toString(arr)); int d = (arr.length)/2; while(原创 2020-06-27 11:16:13 · 181 阅读 · 0 评论