Java基于可扩充数组的向量实现(算法源码)

/* 高手之作，本人谨以收藏者身份拿出共享供大家参考! */
/*
 * 向量接口
 */
package dsa;
public interface Vector {
//返回向量中元素数目
 public int getSize();
//判断向量是否为空
 public boolean isEmpty();
//取秩为r的元素
 public Object getAtRank(int r)
 throws ExceptionBoundaryViolation;
//将秩为r的元素替换为obj
 public Object replaceAtRank(int r, Object obj)
 throws ExceptionBoundaryViolation;
//插入obj，作为秩为r的元素；返回该元素
 public Object insertAtRank(int r, Object obj)
 throws ExceptionBoundaryViolation;
//删除秩为r的元素
 public Object removeAtRank(int r)
 throws ExceptionBoundaryViolation;
}
/*
 * 基于数组的向量实现
 */
package dsa;
public class Vector_Array implements Vector {
 private final int N = 1024;//数组的容量
 private int n = 0;//向量的实际规模
 private Object[] A;//对象数组
//构造函数
 public Vector_Array() {
  A = new Object[N];
  n = 0;
 }
//返回向量中元素数目
 public int getSize() { return n; }
//判断向量是否为空
 public boolean isEmpty() { return (0 == n) ? true : false; }
//取秩为r的元素
 public Object getAtRank(int r)//O(1)
 throws ExceptionBoundaryViolation {
  if (0 > r || r >= n) throw new ExceptionBoundaryViolation("意外：秩越界");
  return A[r];
 }
//将秩为r的元素替换为obj
 public Object replaceAtRank(int r, Object obj)
 throws ExceptionBoundaryViolation {
  if (0 > r || r >= n) throw new ExceptionBoundaryViolation("意外：秩越界");
  Object bak = A[r];
  A[r] = obj;
  return bak;
 }
//插入obj，作为秩为r的元素；返回该元素
 public Object insertAtRank(int r, Object obj)
 throws ExceptionBoundaryViolation {
  if (0 > r || r > n) throw new ExceptionBoundaryViolation("意外：秩越界");
  if (n >= N) throw n