0 votes 0 votes 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 . Algorithms gatebook test-series algorithm-design + – radha gogia asked Nov 16, 2018 retagged Jun 11, 2022 by Arjun radha gogia 492 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments radha gogia commented Nov 17, 2018 reply Follow Share @srestha , cpu quanta is 1 unit , deadline is tk right ? Becoz it is already mentioned that the job should be started of before tk . 0 votes 0 votes Manas Mishra commented Nov 17, 2018 reply Follow Share @navneet can u provide the link 0 votes 0 votes kumar.dilip commented Nov 17, 2018 reply Follow Share @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 1 votes 1 votes Please log in or register to add a comment.