Gatebook Test series ques

Question

Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadline , so it should take O(n^2) in worst case .

Comments

@srestha , cpu quanta is 1 unit , deadline is tk right ? Becoz it is already mentioned that the job should be started of before tk .

---

@navneet can u provide the link

---

@Manas Mishra

https://ocw.mit.edu/courses/civil-and-environmental-engineering/1-204-computer-algorithms-in-systems-engineering-spring-2010/lecture-notes/MIT1_204S10_lec10.pdf