jossmoff/Urinal-Problem-in-Linear-Time

Consider a person walks into a male bathroom with n urinals and Φ is the set of free urinals and Ξ is the set of occupied ones, where should this person go to maximise their privacy? I demonstrate an algorithm to select the most appropriate urinal in linear time and propose a new extension to the original problem.

TeX