ANALYSIS AND DESIGN OF
ALGORITHMS
LAB FILE
SHALINI RAJPUT
2K17CSUN01179
, ACTIVITY
SELECTION
PROBLEM:
GREEDY ALGORITHM
, TIME COMPLEXITY: -
O (n log n). It takes O(n) time when it is given that input activities are always sorted.
ALGORITHMS
LAB FILE
SHALINI RAJPUT
2K17CSUN01179
, ACTIVITY
SELECTION
PROBLEM:
GREEDY ALGORITHM
, TIME COMPLEXITY: -
O (n log n). It takes O(n) time when it is given that input activities are always sorted.