Design and Analysis of Algorithms20795 marksTime and Space Complexity
Write short notes on: a) Best, Worst and average case complexity b) Greedy Strategy
Write short notes on: a) Best, Worst and average case complexity b) Greedy Strategy [5]
--- When analyzing an algorithm, the running time often depends not just on the size of the input but also on the particular instance of the input. To capture this, we define three cases: --- - It gives the lower bound on the running time of the algorithm for any instance of input. - This indicat...