We recently got together and discussed the algorithm we are going to use for the schedule generator. We've come up with a way so that it performs better than brute force, but still gives us all of the permutations of the schedule that we want. It will take in a list of classes, the algorithm will then create a list for each class of each of the class's sections. We will then step through the list of lists and compare each section to the other class's sections. On the comparison of the first two section lists, if the sections fit, another list of the possible schedule will be created. We then use the new schedule lists to compare with the other classes. The growth of the # of lists is the number of current schedule lists * the number of classes in the next section list. If there is a class that does not have a section that fits with any of the possible schedule lists, the algorithm will short circuit and declare that there are no possible schedules with the selected set of classes.