 The method starts by sorting pairs of elements far apart from each other, then progressively reducing the gap between elements to be compared.By starting with far apart elements, it can move some out-of-place elements into position faster than a simple nearest neighbor exchange.Donald Shell published the first version of this sort in 1959.