Schedulizer
Jul. 21st, 2004 10:12 amWell, I stayed up till 3 last night doodling on paper figuring out an algorithm to calculate all non-overlapping schedules from your class list on schedulizer. What did I come up with? A 6 line recursive function :-D. It's extremely efficient, well, in comparison to my previous solution which involved calculating just about all possible permutations and checking each one for conflicts. That took about 40 seconds to run on a complex list of classes. This takes ~1. :-) Maybe if I coded it in c and called it separately rather than letting it run in php it would go even faster... I'll have to try that tonight.
no subject
Date: 2004-08-04 04:31 pm (UTC)