The element with the smallest value is determined and swapped for the first element, and then the smallest value of the unsorted elements is determined and swapped for the second-to-the-first element.   This operation is repeated in the same way.

Two adjacent elements are repeatedly compared and swapped if the first element is larger than the second.   This operation is repeated until all elements are arranged in an orderly fashion.

An intermediate reference value is determined, and then the elements are divided into two groups of “larger” values and “smaller”values.   This operation is recursively repeated.

Each set of the elements extracted at regularintervals is sorted, and then the interval is further decreased. The operation is repeatedly performed until the interval becomes 1.