The input is a set of jobs j1, j2, ... , jN, each of which takes one time unit to
Chapter 10, Problem 10.2(choose chapter or problem)
The input is a set of jobs j1, j2, ... , jN, each of which takes one time unit to complete.Each job ji earns di dollars if it is completed by the time limit ti, but nomoney if completed after the time limit.a. Give an O(N2) greedy algorithm to solve the problem. b. Modify your algorithm to obtain an O(N logN) time bound. (Hint: The timebound is due entirely to sorting the jobs by money. The rest of the algorithmcan be implemented, using the disjoint set data structure, in o(N logN).)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer