A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. Which of the following sorting algorithms does not have a worst case running time of O(n2)?
a. Quick sort
b. Bubble sort
c. Merge sort
d. Insertion sort
Answer:Merge sort
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here