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

Related MCQs

• Shell sort is applied on the elements 27 59 49 37 15 90 81 39 and the chosen decreasing sequence of increments is (5,3,1). The result after the first iteration will be
• What is the best case and worst case complexity of ordered linear search?
• What is the best case complexity of selection sort?
• Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
• What is the worst case time complexity of inserting a node in a doubly linked list?
• What is the average case time complexity for finding the height of the binary tree?
• What is the average case time complexity of binary search using recursion?
• What is the worst case time complexity of LSD radix sort?
• The worst case complexity of deleting any arbitrary node value element from heap is
• What is the worst case complexity of binary search using recursion?