☰
GkSeries.com
✕
Current Affairs
GK
Courses
Aptitude
Banking
English
UGC NET
Home
Computer Engineering
which of the following sorting algorithms does not have a worst case running time of O(n
2
)
Which of the following sorting algorithms does not have a worst case running time of O(n
2
)?
[A] Insertion sort
[B] Quick sort
[C] Bubble sort
[D] Merge sort
Answer & Explanation
Option: [D]
⭐ Make GKSeries Your Preferred Source on Google
Add GKSeries as Preferred Source
← Go To First Question
Next Question →
Click Here to Read more questions