If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sortimplementation, then the best case time complexity will be

M

Mr. Dubey • 52.30K Points
Coach

Q. If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell sortimplementation, then the best case time complexity will be

(A) O(nlogn)

(B) O(n)

(C) O(n2)

(D) O(logn)

Correct : Option (A)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Which of the followings is/are automatically added to every class, if we do not write our own?

Q. With SQL, how do you select all the records from a table named “Persons” where the value of the column “FirstName” ends with a

Q. The alternate solution for a demultiplexer-register combination circuit is

Q. The algorithm terminates in _____ steps

Q. Which of the following is not an integrity constraint?

Q. When waves bend away from straight lines of travel, it is called

Q. TCP/IP port number 20 is assigned for .

Q. When users are involved in complex tasks, the demand on can be significant.

Q. What is the type of inf?

Q. In NOR gate based S-R latch if both S and R inputs are set to logic 0, the previous output state is maintained.