Introduction - If you have any usage issues, please Google them yourself
1, there are n students, each student has m gate results, gate m of each student accomplishments to achieve with a single list, n corresponding to n students in single-linked list head pointer with a pointer array of unified storage. 1) the establishment of the storage structure. 2) Find the first i of a student success course. List of node structure: struct node (char* nam /* nam for the courses name*/float sco /* sco course for success*/struct node* link /* link to point to the next program node point pointer* /