A pseudo-code description of our randomized Shellsort algorithm, which assumes n is a power of two, is as shown in Figure 2. (We also provide a complete Java implementation in Figure 5, in Section 5.) Clearly, the description of our randomized Shellsort algorithm shows that it runs in O(nlogn) time, since we performO(n)compare-exchangeoperationsineachoflogn iterations.