Question
a.
heap sort
b.
bubble sort
c.
selection sort
d.
insertion sort
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be
Subho Das : June 26, 2023
1. Insertion sort is easy to implement.
2. In rearranging work we need to insert the book in its correct position and it is the fundamental ideo of insertion sort
3. It is Sweetable for short number of
element .
Similar Questions
Discover Related MCQs
Q. The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is 4 digit decimal number)
View solution
Q. Where is linear searching used?
View solution
Q. What is the best case for linear search?
View solution
Q. What is the worst case for linear search?
View solution
Q. What is the best case and worst case complexity of ordered linear search?
View solution
Q. Which of the following is a disadvantage of linear search?
View solution
Q. What is the advantage of recursive approach than an iterative approach?
View solution
Q. Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion?
View solution
Q. Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
View solution
Q. What is the worst case complexity of binary search using recursion?
View solution
Q. What is the average case time complexity of binary search using recursion?
View solution
Q. What are the applications of binary search?
View solution
Q. Binary Search can be categorized into which of the following?
View solution
Q. Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?
View solution
Q. Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations?
View solution
Q. What is the time complexity of binary search with iteration?
View solution
Q. When is the uniform binary search an optimization over the usual binary search?
View solution
Q. Given delta[4] is a global array and number of elements in the sorted array is 10, what are the values in the delta array?
View solution
Q. What is the time complexity of uniform binary search?
View solution
Q. Given, arr = {1,3,5,6,7,9,14,15,17,19} key = 17 and delta = {5,3,1,0}
How many key comparisons are made?(exclude the comparison used to decide the left or right sub array)
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
