Performance of Algorithm

Explain how performance of algorithm is analysed?

Questions by subindas

Showing Answers 1 - 1 of 1 Answers

samik mukherjee

  • Jul 1st, 2008
 

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.

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions