实验报告4：群体类和群体数据(5)

InsertAt(item); }

template

void LinkedList::InsertRear(const T& item) {

Node *newNode; prevPtr = rear;

newNode = GetNode(item); if (rear == NULL)

front = rear = newNode; else {

rear->InsertAfter(newNode); rear = newNode; }

currPtr = rear; position = size; size++; }

template

void LinkedList::InsertAt(const T& item) {

Node *newNode;

if (prevPtr == NULL) {

newNode = GetNode(item,front); front = newNode; } else {

newNode = GetNode(item);

prevPtr->InsertAfter(newNode); }

if (prevPtr == rear) {

rear = newNode; position = size; }

currPtr = newNode; size++; }

template

void LinkedList::InsertAfter(const T& item) {

21

Node *p;

p = GetNode(item); if (front == NULL) {

front = currPtr = rear = p; position = 0; } else {

if (currPtr == NULL) currPtr = prevPtr;

currPtr->InsertAfter(p); if (currPtr == rear) {

rear = p;

position = size; } else

position++;

prevPtr = currPtr; currPtr = p; }

size++; }

template

T LinkedList::DeleteFront(void) {

T item; Reset();

if (front == NULL) {

cerr << \ exit(1); }

item = currPtr->data; DeleteAt(); return item; }

template

void LinkedList::DeleteAt(void) {

Node *p;

if (currPtr == NULL) {

22

cerr << \ exit(1); }

if (prevPtr == NULL) {

p = front;

front = front->NextNode(); } else

p = prevPtr->DeleteAfter(); if (p == rear) {

rear = prevPtr; position--; }

currPtr = p->NextNode(); FreeNode(p); size--; }

#endif // LINKEDLIST_CLASS #include \int main() {

Queue A;

for(int i=0;i<5;i++) {

A.QInsert(2*i+1); }

cout << \队列A的元素为：\ while(!A.QEmpty()) {

cout << A.QFront() << \ A.QDelete(); }

cout << endl; } 4、 5、

#include #include %using namespace std; int main() {

23

Array A(10); int i,k;

int SortType; int SearchNum;

cout << \请输入10个整数\ for(i=0;i<10;i++) {

cout << \输入第\个数字：\ cin >> A[i]; }

cout << \输入的数组为：\ for(i=0;i<10;i++)

cout << A[i] << \ cout << endl;

cout << \请选择排序方法：1.直接插入排序 2.直接选择排序 3.冒泡排序：\ cin >> SortType; switch(SortType) {

case 1:

A.InsertionSort(); break; case 2:

A.SelectionSort(); break; case 3:

A.BubbleSort(); break; default:

cout << \输入错误，程序退出!\ exit(0); }

cout << \排序后的数组为：\ for(i=0;i<10;i++)

cout << A[i] << \ cout << endl;

cout << \请输入待查找的数字：\ cin >> SearchNum;

k= A.SeqSearch(SearchNum); if (k<0)

cout << \没有找到数字\ else

cout << SearchNum << \是第\个数字\}

#ifndef ARRAY1_CLASS

24

#define ARRAY1_CLASS #include #include using namespace std; #ifndef NULL

const int NULL = 0; #endif

enum ErrorType

{invalidArraySize, memoryAllocationError, indexOutOfRange}; char *errorMsg[] = {

\ \};

template class Array {

private:

T* alist; int size;

void Error(ErrorType error,int badIndex=0) const; public:

Array(int sz = 50); Array(const Array& A); ~Array(void);

Array& operator= (const Array& rhs); T& operator[](int i); operator T* (void) const; int ListSize(void) const; void Resize(int sz); void InsertionSort(); void SelectionSort(); void BubbleSort(); int SeqSearch(T key); };

template

void Array::Error(ErrorType error, int badIndex) const {

cerr << errorMsg[error];

if (error == indexOutOfRange) cerr << badIndex; cerr << endl; exit(1); }

25

百度搜索“77cn”或“免费范文网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读，免费范文网，提供经典小说综合文库实验报告4：群体类和群体数据(5)在线全文阅读。