I am reading a book Data Structures by Yashavnt P. Kanetkar. In page no. 11 of the book, I found out there are three categories of algorithms as stated by the book :
a. Algorithms that grows at least as fast as some function.
b. Algorithms that grow at the same rate.
c. Algorithms that grow no faster.
Later it is stated :
a. is Big Omega (n)
b. is Big theta (n)
c. is Big Oh (n).
I couldn't understand the meaning so searched for some youtube videos. What I learnt from them was Big Omega is the representation of best case scenario. Big Oh is the representation of the worst case scenario. Big theta is the representation of the average case scenario. I know what these cases are. However I can't understand what the book tried to mean by those three categories and how are they related to the three case scenarios.