数据结构
qdhk
这个作者很懒,什么都没留下…
展开
-
堆排序
先写个工具类: package sort; public class ArrayUtils { public static void printArray(int[] array) { System.out.print("{"); for (int i = 0; i < array.length; i++) { System.out.print(array[i]); if原创 2016-08-19 09:48:44 · 159 阅读 · 0 评论 -
冒泡排序
package sort; public class myBubbleSort { public static void main(String[] args) { bubble1sort(); System.out.println("=====增加exchange标志======="); bubble1sortImproved(); } public static void原创 2016-08-19 10:44:06 · 170 阅读 · 0 评论 -
快速排序
package sort; public class myQuickSort { public static void main(String[] args) { int array[] = { 5, 3, 8, 6, 13, 24, 9, 5, 21, 17, 3, 16, -3 }; quickSort(array, 0, array.length - 1); ArrayUti原创 2016-08-19 12:38:55 · 173 阅读 · 0 评论 -
归并排序
package sort; public class mymergeSort { public static void main(String[] args) { int array[] = { 5, 3, 8, 6, 13, 24, 9, 5, 21, 17, 3, 16, -3 }; sort(array, 0, array.length - 1); // ArrayUtils原创 2016-08-19 20:47:30 · 188 阅读 · 0 评论 -
二叉树遍历递归与非递归(java)
import java.util.Stack; public class 二叉树各种遍历 { public static void main(String[] args) { TreeNode one = new TreeNode(1); TreeNode two = new TreeNode(2); TreeNode three = new TreeNode(3); Tree原创 2016-08-15 13:05:46 · 199 阅读 · 0 评论