Seqlist.h(顺序表验证实验头文件)
#ifndef SeqList_H
#define SeqList_H
const int MaxSize = 10;
class Seqlist
{
public:
Seqlist(){ length = 0; }
Seqlist(int a[], int n);
~Seqlist(){}
void Insert(int i, int x);
int Delete(int i);
int Locate(int x);
void PrintList();
private:
int data[MaxSize];
int length;
};
#endif
Seqlist.cpp(顺序表验证实验源文件)
#include<iostream>
using namespace std;
#include"Seqlist.h"
Seqlist::Seqlist(int a[], int n)
{
if (n > MaxSize)throw"参数非法";
for (int i = 0; i < n; i++)
data[i] = a[i];
length = n;
}
void Seqlist::Insert(int i, int x)
{
if (length >= MaxSize)throw"上溢";
if (i<1 || i>length + 1)throw "位置非法";
for (int j = length; j >= i; j--)
data[j] = data[j - 1];
data[i - 1] = x;
length++;
}
int Seqlist::Delete(int i)
{
if (length == 0)throw"上溢";
if (i<1 || i>length)throw"