SuperBeauty的专栏

优先级队列是有排序的类public class PriorityQ { private long[] queArray; private int maxSize; private int nItems; public PriorityQ(int s){ maxSize=s; queArray=new long[maxSize]; nItems=0; } pu

类public class Queue { private long[] queArray; private int maxSize; private int front; private int rear; private int nItems; public Queue(int s){ maxSize=s; queArray=new long[maxSize];

栈的类public class StackX { private int maxSize; private char[] stackArray; private int top; public StackX(int max){ maxSize=max; stackArray=new char[maxSize]; top=-1; } public void push(ch

类public class StackX { private long[] stackArray; private int maxSize; private int top; public StackX(int s){ maxSize=s; stackArray=new long[maxSize]; top=-1; } //添加数据 public void push(

定义一个Person类public class Person { private String lastName; private String firstName; private int age; public Person(String last,String first,int a){ this.lastName=last; this.firstName=first;

public void insertSort(){ int out,in; for(out=1;out<nElems;out++){ long temp=a[out]; in=out; while(in>0&&a[in-1]>=temp){ a[in]=a[in-1]; in--; } a[in]=temp; } }另外几个函数就是插

类public class ArrarySel { private long[] a; private int nElems; public ArrarySel(int max){ a=new long[max]; nElems=0; } public void insert(long value){ a[nElems]=value; nElems++; } publ

类public class Person { private String lastName; private String firstName; private int age; public Person(String last,String first,int a){ lastName=last; firstName=first; age=a; } public

类public class ArrayBub { private long[] a; private int nElems; ArrayBub(int max){ a=new long[max]; nElems=0; } public void insert(long value){ a[nElems]=value; nElems++; } public void d

类public class OrderArray { private long[] a; private int nElems; public OrderArray(int max){ a=new long[max]; nElems=0; } public int size(){ return nElems; } //线性查找 public void insert(lo