tag

#gap-based

2 pages tagged

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

Comb Sort

Comb Sort Comb sort improves bubble sort by comparing elements that are far apart before comparing adjacent elements. It starts with a large gap and repeatedly shrinks that gap until it reaches 1. The main idea is to remove small elements near the end and large elements near the beginning earlier than bubble sort would. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le...

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

Shell Sort

Shell Sort Shell sort extends insertion sort by allowing exchanges of elements that are far apart. It sorts elements at a certain gap, then progressively reduces the gap until it becomes 1. The final pass with gap 1 is a standard insertion sort, but on a partially ordered array. This reduces the number of shifts required compared to plain insertion sort. Problem Given a sequence $A$ of length $n$, reorder...