Introduction - If you have any usage issues, please Google them yourself
10. Write a program, enter the number of student achievement information the keyboard, each student achievement information includes: Student ID, name, and 8 units results. Then according to the average score of students in descending order of the output number, name and grade point average. 11. The insert a new node in the linked list operation is written as a function: bool insert (Node* & h, int a, int pos) wherein, h is the header pointer, a is the node you want to insert a value, pos (≥0) indicates insertion position. When pos 0 are shown in the table header insert otherwise, indicating that after the first pos-node insertion. Operation successful return true, otherwise returns false. 12. to delete a node in the linked list operation is written as a function: bool remove (Node* & h, int & a, int pos) wherein, h is table pointer, a used to store deleted node value, pos (> 0) indicates the position of deleted nodes. Operation successful return true, otherwise re