Description: This system is a student performance management system
Has the following functions:
1. With the sequential list n students student id and achievements input
Thought:
In the main function in the number of students finish the limit, and define the structure of the student body pointer, input function call.
With the structure body complete student information recorded pointer.
2. Choose ranking to n with a student s result in descending order
Thought:
Definition 2 students structures pointer, with choice method is used to complete student achievement in order.
3. Use stack and queue of algorithm operating, delete failing students information, keep pass the information in the stack students or the queue
Thought:
Define a stack and a queue, pass the students of get-together, not pass into the stack, the team output students information.
4. ? on
To Search:
File list (Check if you may need any files):
数据结构实践\bitree.h
............\seqqueue.h
............\seqstack.h
............\test.cpp
............\使用说明文档.txt
............\数据结构实践.doc
数据结构实践
Download