Chapter 3, Problem 12RE

In a scheduling program, we want to check whether two appointments overlap. For simplicity, appointments start at a full hour, and we use military time (with hours 0–24). The following pseudocode describes an algorithm that determines whether the appointment with start time start1 and end time end1 overlaps with the appointment with start time start2 and end time end2.

If start1 > start2

 s = start1

Else

 s = start2

If end1 < end2

 e = endl

Else

 e = end2

If s < e

 The appointments overlap.

Else

 The appointments don’t overlap.

Trace this algorithm with an appointment from 10–12 and one from 11–13, then with an appointment from 10–11 and one from 12–13.