Design and analysis of algorithms

1 flashcards · Computer Science · by Dr. Karunambiga Kanagavel

1. What is Big-Oh notation?

   It gives the upper bound for the time complexity of given algorithm