Prove that the running time of an algorithm is (g (n)) if and only if its worst-case

Question:

Prove that the running time of an algorithm is Θ(g (n)) if and only if its worst-case running time is O(g (n)) and its best-case running time is Ω(g (n)).

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Introduction to Algorithms

ISBN: 978-0262033848

3rd edition

Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest

Question Posted: