The complexity of the average case of an algorithm is
(a) Much more complicated to analyze than that of worst case
(b) Much more simpler to analyze than that of worst case
(c) Sometimes more complicated and some other times simpler than that of worst case
(d) None of the mentioned
I have been asked this question in exam.
This interesting question is from Sorting in chapter Query Processing Techniques of Database Management