MCQOPTIONS
Bookmark
Saved Bookmarks
→
Shell Sort Multiple Choice
→
(MCQs) 1
→
The worst case running time of shell sort, using S...
1.
The worst case running time of shell sort, using Shell s increments is?
A.
O(N)
B.
O(N log N)
C.
O(log N)
D.
O(N<sup>2</sup>)
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the worst case analysis of Shell sort using Sedgewick s increments?
What is the worst case analysis of shell sort using Shell s increments?
What is the general form of Shell s increments?
What is the worst case running time of shell sort using Hibbard s increments?
On how many increment sequences does the worst case analysis of shell sort depends?
Which of the following statements is the basic for loop for a shell sort algorithm?
Given an array of the following elements 81,94,11,96,12,35,17,95,28,58,41,75,15.What will be the sorted order after 5-sort?
Why is Shell sort called as a generalization of Insertion sort?
Which of the following sorting algorithms is closely related to shell sort?
Shell sort uses a sequence called a incrementing sequence to sort the elements.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies