线性结构及其应用的链表遍历与学号匹配操作实验报告

实验报告1主要涉及链表的遍历和应用，其中链表的遍历要考虑空表的情况并通过节点之间的联系进行遍历操作。实验要求收集两个班级的学生成绩信息并按降序排列，可以利用链表的插入和删除操作的良好特性，避免顺序存储方式可能带来的资源浪费。设计思想包括选择线性链表做为存储结构，每个节点包含学生的信息和指向下一个节点的指针。此外，还可以利用链表的归并算法来合并两个有序链表。通过实验可深入理解线性结构的应用以及链表的灵活性和高效性。 Haerbin Institute of Technology (Shenzhen) "Data Structure" Experiment Report Experiment 1 Linear Structure and Its Application College: Computer Science and Technology Name: Student Number: Major: Computer Science and Technology Date: 2020-04-05 "Data Structure" Experiment Report 1 I. Problem Analysis The task requires collecting the academic performance information of two classes and sorting it in descending order. Each student's data includes the class, student ID, and performance information, which need to be stored as a whole using a struct. The data can be continuously added, and two linear lists can be used to store the information of students in two classes respectively. However, if the data is stored in an array or other sequential storage method, a large number of movement operations are required each time a student's information is stored, and the number of students is unknown, which may result in resource waste. When taking into account the good characteristic of the insertion and deletion operations of the linked list, with a time complexity of O(1), and the ability to dynamically expand memory according to the actual situation, a linear linked list is a suitable storage structure. To merge the information of students from two classes, the merge algorithm of the linked list can be used, as both linked lists are sorted, and the time complexity of merging is O(n). II. Detailed Design 2.1 Design Concept 1. Choose a linear linked list as the storage structure. Each node includes three pieces of student information and a pointer to the next node.