文件名称:xiangpaixu
介绍说明－－下载内容均来自于网络，请自行研究使用
假设一个链表中包含了一个班级内所有的学生的信息，每个结点含有以下数据域 ：学号、姓名、各门课成绩以及平均分（假定所有的分数均为0-100的整数），设计程序用箱排序对指定的成绩排序，并输出排序结果。基本要求：
（1)每个箱子（0-100）描述成一个链表；
（2)能够从欲排序链表的首部开始，逐个删除每个结点，并把所删除的结点放入适当的箱子中。
（3)收集并链接每个箱子中结点，产生一个排序的链表并输出结果。
-Assuming a list contains a class of students all the information, each node contains the following data field: No. school, name, the class results and the average points (assuming all the scores are 0-100 integer) , the design process with me to sort the results on the specified sort and output the results. The basic requirements: (1) Each box (0-100) described as a linked list (2) To sort list from the first to start, by the deletion of each node, and the deleted node Add appropriate the box. (3) to collect and link the boxes in each node to create a sort of list and output.
（1)每个箱子（0-100）描述成一个链表；
（2)能够从欲排序链表的首部开始，逐个删除每个结点，并把所删除的结点放入适当的箱子中。
（3)收集并链接每个箱子中结点，产生一个排序的链表并输出结果。
-Assuming a list contains a class of students all the information, each node contains the following data field: No. school, name, the class results and the average points (assuming all the scores are 0-100 integer) , the design process with me to sort the results on the specified sort and output the results. The basic requirements: (1) Each box (0-100) described as a linked list (2) To sort list from the first to start, by the deletion of each node, and the deleted node Add appropriate the box. (3) to collect and link the boxes in each node to create a sort of list and output.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
箱排序设计
..........\源程序
..........\......\binsort.c
..........\......\student.txt
..........\源程序
..........\......\binsort.c
..........\......\student.txt