title: Event scheduling
body: <p>You are given a set of <em>n</em> jobs. Each job is associated with a starting time and an ending time, both represented as integers, and the profit you would make from it. You have to determine which jobs to take to maximize profit, keeping in mind that only one job can be done at any one time. Is there an  algorithm for this with better than <strong>O(n<sup>2</sup>)</strong> efficiency?</p>