数据结构课程设计--统计成绩

#include"List.h" List::List() { count = 0; head = NULL; } List::~List() { student *p, *q; p = head; for(int i = 0;i != count;i ++) { q = p->next; delete p; p = q; } count = 0; head = NULL; } Error_code List::insert(int position, const std::string nam, const std::string num, const int Chi, const int math, const int Eng, const int data) { if (position < 0 || position > count) return range_error; student *new_student, *previous, *following; if (position > 0) { previous = set_position(position - 1); following = previous->next; } else following = head; new_student = new student(nam, num, Chi, math, Eng, data, following); if (new_student == NULL) return overflow; if (position == 0) head = new_student; else previous->next = new_student; count++; return success; } student* List::set_position(int position) const { student *q = head; for (int i = 0; i < position; i++) { q = q->next; } return q; } void List::insertion_sort() { student *first_unsorted, *last_sorted, *current, *trailing; if(head!=NULL) { last_sorted = head; int n = this->count; for(int i=1 ;i<n;i++) { first_unsorted = last_sorted->next; if(first_unsorted->total > head->total) { // Insert *first_unsorted at the head of the sorted list: last_sorted->next = first_unsorted->next; first_unsorted->next = head; head = first_unsorted; } else { trailing = head; current = trailing->next; // Search the sorted sublist to insert *first_unsorted: while(first_unsorted->total < current->total){ trailing = current; current = trailing->next; } // *first_unsorted now belongs between *trailing and *current if(first_unsorted==current) last_sorted = first_unsorted; // already in right position else { last_sorted->next = first_unsorted->next; first_unsorted->next = current; trailing->next = first_unsorted; } } } } } void List::traverse(void (*visit)(std::string &num,std::string &name, int &total, int &chinese,int &math, int &english, int &datastr)) { student *q; q = head; for (int i = 0;i != count;i ++) { (*visit)(q->number,q->name,q->total,q->Chinese,q->Math,q->English,q->DataStruction); q = q->next; } }