shell sort is a rather curious algorithm, quite different from other fast sorting algorithms. It s actually so different that it even isn t an O(nlogn) algorithm like the others, but instead it s something between O(nlog2n) and O(n1.5) depending on implementation details. Given that it s an in-place non-recursive algorithm and it compares very well to the other algorithms, shell sort is a very good alternative to consider.