Question
a.
Insertion sort
b.
Merge sort
c.
Quick sort
d.
Bubble 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. Which of the following sorting algorithms does not have a worst case running time of O (n^2) ?
Similar Questions
Discover Related MCQs
Q. The quick sort algorithm exploit _________ design technique.
View solution
Q. The total number of companions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file is
View solution
Q. The complexity of searching an element from a set of n elements using Binary search algorithm is
View solution
Q. Which of the following sorting methods would be most suitable for sorting a list which is almost sorted
View solution
Q. Quick sort is also known as
View solution
Q. The goal of hashing is to produce a search that takes
View solution
Q. The best average behaviour is shown by
View solution
Q. Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?
View solution
Q. A characteristic of the data that binary search uses but the linear search ignores is the___________.
View solution
Q. Which of the following sorting algorithm is stable ?
View solution
Q. In binary search, average number of comparison required for searching an element in a list if n numbers is
View solution
Q. The worst case of quick sort has order
View solution
Q. Which technique is suitable for performing a search in a small array or in an unsorted array?
View solution
Q. What finds the largest element in the array, and puts it in the proper place?
View solution
Q. Which array is the fastest on an average, but sometimes unbalanced partitions can lead to very slow sorting?
View solution
Q. In computer science, what is of immense importance and is one of the most extensively researched subjects?
View solution
Q. It is estimated that around __________ of all CPU cycles are used to sort data?
View solution
Q. In which field, a sorting algorithm refers to an algorithm the function of which is to put elements of a list in a certain order?
View solution
Q. Which of the following statements is correct?
(i) Sorting is also often used to produce human-readable output.
(ii) The output should not be a permutation or reordering of the input.
View solution
Q. The analysis of bubble sort was done as early as_____________.
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!
