Which of the following algorithms has a worst case complexity of O(n log2n) ?
A) insertion sort
B) selection sort
C) bubble sort
D) merge sort
E) none of the above
Correct Answer:
Verified
Q1: _ is the process of arranging a
Q2: A _ search is more efficient than
Q3: Which of the following is not a
Q4: Which of the following algorithms is most
Q6: Bubble sort is the most efficient searching
Q7: The _ algorithm sorts a list of
Q8: As the number of items in a
Q9: The _ algorithm sorts values by repeatedly
Q10: Which of the following algorithms has a
Q11: If there are more items in a
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents