Move entries more than one position at a time by h-sorting the array.
3x + 1: 1, 4, 13, 40, 121, 364, ...
public class Shell
{
public static void sort(Comparable[] a)
{
int N = a.length;
int h = 1;
while (h < N / 3) h = 3 * h + 1;
while (h >= 1)
{
//h-sort the array
for (int i = h; i < N; i ++)
{
for (int j = i; j >= h && less(a[j], a[j - h]); j -= h)
exch(a, j, j-h);
}
h /= 3;
}
}
}
T(n) = O(n3/2)