A ShellSort with a twist (updated)

Introducing a shellsort hybrid that slips pre-sorted data to a built in walker with a very fast smart-find (binary search) twister. This shell algorithm is founded on a very solid performer that was originally developed by vb2themax, and optimized further by several very talented coders, before I twisted a little more out of it in this hybrid version. Although this algorithm is optimized for re-sorting and reverse sorting, it also has been greatly boosted in raw outright speed to square up against anything, anytime! This is the fastest shellsort I know of by far*. This algorithm excels on both un-sorted and pre-sorted data. *A hybrid shellsort with a twist, and no bubbles.