template int SeqList::Insert(Type &x, int i) {if (i<0 || i>last+1 || last== Ma
template int SeqList::Insert(Type &x, int i) {
if (i<0 || i>last+1 || last== MaxSize-1) return 0;
else {
Last++;
for(int j=last;j
data[i]=x;
return 1;
}
}
对于结点类型为SeqList的顺序表,以上算法的功能为:()