What is the worst case time complexity of cocktail sort?
(a) O(n)
(b) O(n log n)
(c) O(n^2)
(d) O(log n)
I have been asked this question during a job interview.
I would like to ask this question from Sorting in chapter Sorting of Data Structures & Algorithms II