MCQOPTIONS
Bookmark
Saved Bookmarks
→
Gnome Sort Multiple Choice
→
General
→
What is the average case time complexity of gnome...
1.
What is the average case time complexity of gnome sort?
A.
O(n)
B.
O(n<sup>2</sup>)
C.
O(n log n)
D.
O(log n)
Answer» C. O(n log n)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the average case time complexity of gnome sort?
What is the worst case time complexity of gnome sort?
What is the best case time complexity of gnome sort?
Gnome sort uses which of the following method to implement sorting?
The given array is arr = {1,2,4,3,5}.The number of iterations required to sort the array using gnome sort will be _________
Auxiliary space used by gnome sort is _________
Which of the following pair of sorting algorithms are stable?
How many loops are required to implement gnome sorting algorithm?
Gnome sort is also called __________
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