☰

GkSeries.com

Home/
Computer Engineering/
which of the following sorting algorithms does not have a worst case running time of O(n²)

Q.

Which of the following sorting algorithms does not have a worst case running time of O(n²)?

[A] Insertion sort

[B] Quick sort

[C] Bubble sort

[D] Merge sort

Answer & Explanation
Option: [D]

Click Here to Read more questions