This issue proposes adding a C++ backend for the Cocktail Sort algorithm (also known as Bidirectional Bubble Sort or Shaker Sort) to the pydatastructs library. Cocktail Sort is a comparison-based sorting algorithm that improves upon Bubble Sort by sorting an array or list in both directions—forward (left to right) and backward (right to left)—in alternating passes. This bidirectional approach reduces the number of passes needed for already partially sorted data, making it more efficient in certain cases.