What is the best-case time complexity of cocktail sort?

Sorting Algorithms Questions



80 Short 66 Medium 49 Long Answer Questions Question Index

What is the best-case time complexity of cocktail sort?

The best-case time complexity of cocktail sort is O(n), where n is the number of elements in the array.