In algorithmic complexity, does omega large represent the best case or not?

Question

Algorithms

Hello. I read different articles and watch different videos on algorithms and calculating their complexity, and I can’t understand: does the big omega mean the best case or not? In some sources, the best case is also denoted by the largest of what expression with n.

Answer 1

https://habrahabr.ru/post/188010/
O-big - worst case
Omega-big - best case
Theta-big - when the worst and best cases are the same

Answer 2

It's not an omega, it's O-big. Roughly speaking - restriction from above. An algorithm that has complexity O(f(n)), as n grows, will grow (in terms of running time) no faster than C*f(n) (C is a constant)
UPD. Soapy eyes, my problem, the answer is yes, "omega" notation denotes the best case, O-large - asymptotically worst