tag

#bidirectional

2 pages tagged

Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Cocktail Shaker Sort

Cocktail Shaker Sort Cocktail shaker sort extends bubble sort by performing passes in both directions. One pass moves the largest element to the end, and the next pass moves the smallest element to the beginning. This reduces the number of passes needed compared to standard bubble sort. It is also called bidirectional bubble sort. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le A[1]...

Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Double Selection Sort

Double Selection Sort Double selection sort improves selection sort by selecting both the minimum and maximum elements in each pass. It places the minimum at the beginning and the maximum at the end, reducing the number of passes by roughly half. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le A[1] \le \cdots \le A[n-1] $$ Algorithm Maintain two boundaries, left and right. In...