[数据结构]实验2- 线性表综合实验

#pragma once
#include "SeqList.h"


SeqList::SeqList(Student nodes[], int n) {
	if (n <= 0 || n > MaxSize_SeqList)throw "overflow";
	//循环赋值
	for (int i = 0; i < n; i++) {
		Data_SeqList[i]= nodes[i];
	}
	//矫正长度

	length = n;
}

bool SeqList::insert(Student node) {
	if (length >= MaxSize_SeqList)return false;
	Data_SeqList[length++] = node;
	return true;
}

bool SeqList::delete_by_id(int Sno) {
	//寻找节点;
	for (int i = 0; i < length; i++) {
		if (Data_SeqList[i].Sno == Sno)
			//删除移动操作
			for (i; i < length; i++) {
				Data_SeqList[i] = Data_SeqList[i + 1];
				length--;
			}
	}return true;
}

void SeqList::print_SeqList() {
	for (int i = 0; i < length; i++) {
		cout << "----------------------------" << endl;
		cout << Data_SeqList[i].Sno << endl;
		cout << Data_SeqList[i].Sname <<