ssdut2013的专栏

public class ArrayIns { private long[] theArray; private int nElems; public ArrayIns(int max){ theArray=new long[max]; nElems=0; } public void insert(long value){

public class ArrayIns { private long[] theArray; private int nElems; public ArrayIns(int max){ theArray=new long[max]; nElems=0; } public void insert(long value){

public class ArrayPar { private long[] theArray; private int nElems; public ArrayPar(int max){ theArray=new long[max]; nElems=0; } public void insert(long value){

public class ArraySh { private long[] theArray; private int nElems; public ArraySh(int max){ theArray=new long[max]; nElems=0; } public void insert(long value){

归并算法的中心是归并两个已经有序的数组public class MergeApp { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub int[] arrayA={23,47,81,95};

对于上面把问题抽象出来的那段描述，对于n > 1的时候，又可以抽象（换成“总结”这个词会没那么大压力吗？）出这3步： (1)、将底盘n以上的环（n-1个）移动到B (2)、将底盘n从A移动到C (3)、将B上的环（n-1个）移动到C 其中第1步和第3步的步数是一样的，因为环的数量一样（n-1个），只是目标的柱子不同而已。public class TowerApp { /**

package cn.gwssi;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;public class TriangleApp { /** * @param args */ static int theNumber;

public class Link { public long lData; public Link next; public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.print(lData+" "); }}p

public class Link { public long lData; public Link next; public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.print(lData+" "); }}pu

public class Link { public long lData; public Link next; public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.print(lData+" "); }}pu

2.4修改orderedArray.java程序（清单2.4）使insert()、delete()与find()方法一样都使用 二分查找，正如书中所建议的那样。 2.5向orderedArray.java程序（清单2.4）的OrdArray类加入一个merge()方法，使之可以将两个有序的源数组合并成一个有序的目的数组。在main()中添加代码，向两个源数组中插入随机数，调用merge()方法，

3.1 bubbleSort.java程序（清单3.1）和BubbleSort专题applet中，in索引变量都是从左到 右移动的，直到找到最大数据项并把它移动到右边的out变量外。修改bubbleSort()方法， 使它成为双向移动的。这样，in索引先像以前一样，将最大的数据项从左移到右，当它到 达out变量位置时，它掉头并把最小的数据项从右移到左。需要两个外部索引变量，一个在 右边（以前的out

4.2 根据本章里对双端队列的讨论编写一个Deque类，它应该包括insertLeft()、insertRight()、removeLeft()、removeRight()、 isEmpty()、isFull()方法。要求像队列那样支持在数据末端的回绕。public class DuQueue { private int maxSize; private long[] queArr

4.3 编写一个基于上机作业4.2的Deque类的栈类。这个栈类应该与 stack.java程序（清单4.1）中的StackX类具有机同的方法和功能。public class StackY { private DuQueue stackQueue; public StackY(int size){ stackQueue = new DuQueue(size);

/** * 优先级队列 */public class PriorityQ { private int maxSize; private long[] queArray; private int nItems; public PriorityQ(int s){ maxSize =s; queArray=new long

4.5 队列通用于模拟人、汽车、飞机、业务等等的流动情况。应用queue.java 程序（清单4.4）的Queue类，编写一个程序模拟超市的收款队列。可以用上机 作业4.1的display()方法，显示出顾客的几条队列。可以通过敲击一个键插入 一个新的顾客。为顾客选择在哪一个队列上。收银员为每个顾客服务的时间是 随机的（可假定为按照顾客买了多少东西而定）。一旦结完账，就从队列中删 除该顾客。为了简单

public class StackX { private int maxSize; private long[] stackArray; private int top; public StackX(int s){ maxSize=s; stackArray = new long[maxSize]; top=-1;

public class StackX { private int maxSize; private long[] stackArray; private int top; public StackX(int s){ maxSize=s; stackArray = new long[maxSize]; top=-1;

public class Link { public int iData;//data public double dData;//data public Link next;//reference to next Link public Link(int iData,double dData){ this.iData=iData; th

public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink1(){ System.out.

public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.pr

public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.pr

public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.pr

public class Link { public long dData; public Link next; public Link previous; public Link(long dData){ this.dData=dData; } public void displayLink(){ System.out.p

public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; }}public class SortedList { private Link first;

public class Link { public long lData; public Link next;//reference to next Link public Link(long lData){ this.lData=lData; } public void displayLink(){ System.out.pr

public class Link { public long dData; public Link next; public Link previous; public Link(long dData){ this.dData=dData; } public void displayLink(){ System.out.p