Job Sequencing with Deadline will occur in following steps:
Step 1: Create an array whose size is equal is to the maximum deadline given.This will take constant time.
Step 2: Sort out the jobs in descending order of their profits. Best complexity: O(nlogn)
Step 3: Take the job one by one(O(n)) and find the particular slots to fix that job based on greedy analysis, worst case, slot will found in O(n) time. total complexity: O(n^2)
so overall complexity: O(1) + O(nlogn) +O(n^2) = O(n^2)...