A Prove That The Running Time Of Shellsort Is N2

a. Prove that the running time of Shellsort is (N2) using increments of the form 1, c, c2, . . . , ci for any integer c.
b. Prove that for these increments, the average running time is Θ(N3/2).

Posted in Uncategorized