项目：设计并实现一个学生管理系统，即定义一个包含学生信息（学号，姓名，成绩）的顺序表，可以不考虑重名的情况，系统至少包含以下功能：
1. 根据指定学生个数，逐个输入学生信息；
2. 逐个显示学生表中所有学生的相关信息；
3. 给定一个学生信息，插入到表中指定的位置；
4. 删除指定位置的学生记录；
5. 统计表中学生个数；
6. 利用直接插入排序或者折半插入排序按照姓名进行排序；
7. 利用快速排序按照学号进行排序；
8. 根据姓名进行折半查找，要求使用递归算法实现，成功返回此学生的学号和成绩；(Project: the design and implementation of a student management system, the definition of a (including student information, student number, name, score) of the order of the table, can not consider the same situation, at least the system contains the following functions:
1. enter student information one by one according to the number of students assigned;
2. display the relevant information of all the students in the student list one by one;
3. give a student information and insert it to the specified location in the table;
4. delete the student record at the specified location;
5. statistics table number of middle school students;
6. use direct insertion sort or binary insertion sort to sort by name;
7., the use of quick sort, according to the number of students to sort;
8. under the name of bisearch, requires the use of recursive algorithm, the successful return of the student learning and achievement;)