//////////////////////////////////////////////////////////////////////////////////
//main.cpp测试顺序表的算法
////////////////////////////////////////////////////////////////////////////////
#include<string.h>
#include<iostream>
#include<assert.h>
using namespace std;
#ifndef MYSQLIST_H
#define MYSQLIST_H
#include "E:\lijuan\Test Include\mySqlist.h"
#endif
#ifndef EX3_1_TEST_H
#define EX3_1_TEST_H
#include "E:\lijuan\ex3_1Sqlist\ex3_1_test.h"
#endif
void main()
{
int data[]={20,85,45,51,16,95,66,62};
mySqlist<int> list;
int choose;
char continueYesNo='n';
list.setList(data,8);
while(1)
{
choose=0;
system("cls");
cout<<"*******************************★测试顺序表的操作★*****************************"<<endl<<endl;
cout<<"\t1.在第i个元素之前插入一个元素"<<endl;
cout<<"\t2.取第i个元素"<<endl;
cout<<"\t3.查找第一个与某元素相等的元素序号"<<endl;
cout<<"\t其他.结束"<<endl<<endl;
list.displayCurrentList(list.getLength());
cout<<"///////////////////////////////////////////////////////////////////////////"<<endl;
cout<<"请选择你要执行的操作的号码:";
cin>>choose;
if(choose>0&&choose<4)
list.displayCurrentList(list.getLength());
switch(choose)
{
case 1:ex3_1_1(list,continueYesNo);
break;
case 2:ex3_1_2(list,continueYesNo);
break;
case 3:ex3_1_3(list,continueYesNo);
break;
default:cout<<"\n 你选择了结束!"<<endl<<endl;
return;
}
if(continueYesNo!='Y'&&continueYesNo!='y')
break;
}
}