tag

#bubble-sort

4 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]...
algorithms sorting bubble-sort bidirectional
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Odd Even Sort

Odd Even Sort Odd-even sort, also called brick sort, is a variation of bubble sort that separates comparisons into two alternating phases. One phase compares elements at odd-even index pairs, and the other compares even-odd pairs. This structure makes the algorithm suitable for parallel execution, since comparisons within each phase do not overlap. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le A[1] \le...
algorithms sorting bubble-sort parallel-friendly
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Bubble Sort

Bubble Sort Bubble sort is a simple comparison-based sorting algorithm. It repeatedly scans the sequence and swaps adjacent elements when they are in the wrong order. After each pass, the largest unsorted element moves to its correct position at the end. The name comes from the way larger elements gradually “bubble up” toward the right side. Problem Given a sequence $A$ of length $n$, reorder it such that: $$ A[0]...
algorithms sorting bubble-sort arrays
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Optimized Bubble Sort

Optimized Bubble Sort Optimized bubble sort improves the basic version by stopping early when the array becomes sorted. During a pass, if no swaps occur, the algorithm concludes that the sequence is already ordered and terminates. This reduces unnecessary passes, especially for nearly sorted inputs. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le A[1] \le \cdots \le A[n-1] $$ Algorithm Track whether any...
algorithms sorting bubble-sort optimized