Explain how performance of algorithm is analysed?
The performance of an algorithm is analysed by the time complexity as well as its space complexity though both the complexities are trafe-offs between them. If time complexity increases then space complexity decreases & vice-versa. Also the best & worst cases of the time complexities are considered while determining the efficiency of the algorithm