(A) Wort, average and best case scenario of an algorithm
(B) Asymptotic notations that describe upper bound, both above and below bound and lower bound respectively.
(C) Notation used to compare order of growth.
(D) Set of algorithms with worst, second wort and best complexities respectively.

The answer is (B) Asymptotic notations that describe upper bound, both above and below bound and lower bound respectively.