Description: This program consists of three parts: input student information (name and achievements) according to the level of the students to sort the results out student information.
Student information in the input part of the structure of students enter the appropriate information, enter a name, if the type ! Is to halt the importation, go to the sort order function if the input exceeds the maximum number of 500, they are also terminate the program, go to the sorting function, sort, otherwise the implementation of the cycle, to continue to enter the student information.
Sorting function in the sort part of the cycle for students to use a two-tier sort. First of all, take the first student (i = 0), use it, and behind the academic performance of students, if the students in front of students who score less than the back, letting the two students in memory of the information through exch exchange, otherwise In the following students to continue to look for than he scores big, until you
To Search:
File list (Check if you may need any files):
sortstudent.asm