Java数据结构和算法
samkee2010
这个作者很懒,什么都没留下…
展开
-
有序数组与二分查找
[code="java"] //OrderArray.java public class OrderArray { private int[] a; private int nElements; public OrderArray(int max) { a = new int[max]; nElements = 0; } public void in...原创 2015-07-12 01:03:53 · 112 阅读 · 0 评论 -
冒泡排序
[code="java"] //BubbleArray.java public class BubbleArray { private int[] a; private int nElements; public BubbleArray(int max) { a = new int[max]; nElements = 0; } public vo...原创 2015-07-13 12:59:26 · 58 阅读 · 0 评论 -
选择排序
[code="java"] //SelectArray.java public class SelectArray { private int[] a; private int nElements; public SelectArray(int max) { a = new int[max]; nElements = 0; } public void...原创 2015-07-13 20:11:04 · 75 阅读 · 0 评论 -
插入排序
[code="java"] //InsertArray.java public class InsertArray { private int[] a; private int nElements; public InsertArray(int max) { a = new int[max]; nElements = 0; } public void...原创 2015-07-14 15:32:15 · 82 阅读 · 0 评论 -
栈的初步认识
[code="java"] //Stack.java public class Stack { private char[] stackArray; private int maxSize; private int top; public Stack(int max) { maxSize = max; stackArray = new char[maxSize]...原创 2015-07-16 22:21:12 · 84 阅读 · 0 评论 -
栈的运用:翻转字符串
[code="java"] //Stack.java public class Stack { private char[] stackArray; private int maxSize; private int top; public Stack(int max) { maxSize = max; stackArray = new char[maxSize]...原创 2015-07-16 22:23:19 · 202 阅读 · 0 评论