COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Big-oh
|
|
|
Small-oh
|
|
|
Big-omega
|
|
|
Theta
|
Detailed explanation-1: -The symbol, pronounced “little-O of., ” is one of the Landau symbols and is used to symbolically express the asymptotic behavior of a given function.
Detailed explanation-2: -Big-O means “is of the same order as”. The corresponding little-o means “is ul-timately smaller than”: f (n) = o(1) means that f (n)/c !
Detailed explanation-3: -Big-O notation represents the upper bound of the running time of an algorithm. Thus, it gives the worst-case complexity of an algorithm.
Detailed explanation-4: -Big O is the upper bound, while Omega is the lower bound. Theta requires both Big O and Omega, so that’s why it’s referred to as a tight bound (it must be both the upper and lower bound). For example, an algorithm taking Omega(n log n) takes at least n log n time, but has no upper limit.