1.

What is the worst case analysis of Shell sort using Sedgewick s increments?

A. O(N<sup>2</sup>)
B. O(N<sup>3/2</sup>)
C. O(N<sup>4/3</sup>)
D. O(N<sup>5/4</sup>)
Answer» D. O(N<sup>5/4</sup>)


Discussion

No Comment Found