Computer Science Theory

Time: 00:00:00

0

Attempted

15

Not Attempted

0

Marked For Review

0

Attempted & Reviewed

Question 1 of 15

Which sorting algorithm has a worst-case time complexity of O(n^2) but a best-case time complexity of O(n)?

Select Your Answer:

Bubble Sort

Merge Sort

Quick Sort

Heap Sort

Mark for Review

All Questions

Attempted

Not Attempted

Marked for Review

Attempted & Reviewed

Current