线性表顺序存储

1.访问：A[i] .................................O(1)

2.插入：insert(i, item)................O(n)

for(j=n-1; j>=i; j--) A[j+1] = A[j];

A[i] = item;

3.删除：remove(i)......................O(n)

for(; i<n; i++) A[i] = A[i+1];