Efficient Algorithm of Splitting and Merging Classes on Elective Course of College Education

Abstract

Abstract It should take human intervention to adjust the number of each class after the students select elective courses on web by educational administration system in college, because the numbers are often less than the lower limit. This paper puts out an efficient scheduling algorithm to get the resolution of splitting and merging classes by linear time complexity computing on mathematical model. It introduces in detail the principle, the precondition, the procedure and the operation of splitting and merging classes, which illustrated with several charts, diagrams, pseudo-codes in key steps and some notes, and at last validated it by example. Then it could extend to similar issues, for example enrolling and distributing issue.