For activity selection, Dynamic Programming Approach takes O(n^3) time while Greedy Approach takes O(n) time when unsorted and O(n log n) when sorted. It follows Greedy approach as at every step, we make a choice that looks best at the moment to get the optimal solution of the complete problem
