This applet implements the greedy lecture scheduling algorithm. After clicking the button a random number of lecture requests will be generated. The lectures are represented by line segments with endpoints corresponding to the start and finish times. The red segments show an optimal (maximum w.r.t. the number of lectures) schedule for this lecture hall.