1.2 Our Results
In this paper, we present a simple, data-oblivious randomized
version of Shellsort, which always runs in O(n log n) time
and sorts with very high probability. In particular, the
probability that it fails to sort any given input permutation
will be shown to be at most 1/nb, for constant b 1, which
is the standard for “very high probability” (v.h.p.) that we
use throughout this paper.