顺序表

#include<iostream>

using namespace std;

class Student

{

private:

        intdata[10];

        intlength;

        inti,j;

public:

        Student(intn,int a[])

        {

        for(i=0;i<6;i++)

                 data[i]=a[i];

        length=n;

        }

        ~Student(){}

        intGetgrade(int i)

        {

                 if(i<1&&i>length)throw"查找位置非法";

            else

            return data[i-1];

        }

        voidInsert(int i,int x)

        {

                 if(length>=10)throw"上溢";

                 if(i<1||i>length+1)throw"位置";

                 for(j=length;j>=i;j--)

                         data[j]=data[j-1];

                 data[j-1]=x;

                 length++;

        }

        intDelete(int i)

        {

                 intx;

                 if(length==0)throw"下溢";

                 if(i<1||i>length)throw"位置";

                 x=data[i-1];

                 for(j=i;j<length;j++)

                         data[j-1]=data[j];

                 length--;

                 returnx;

        }

        voidPrintList()

        {

                 for(i=0;i<length;i++)

            cout<<data[i]<<endl;

        }

};

int main()

{

        intdata[6]={31,54,76,43,98,75};

        StudentX(6,data);

        cout<<"它们分别是："<<endl;

        X.PrintList();

        cout<<"第三个位置的是:"<<X.Getgrade(3)<<endl;

        X.Insert(6,25);

        cout<<"插入操作："<<endl;

        X.PrintList();

        X.Delete(2);

        cout<<"删除第二个元素："<<endl;

        X.PrintList();

        //X.~Student();

        return0;

}