Data Structures and Algorithms (DSA)

Q5 · Sorting

Back to Full Bank

Data Structures and Algorithms (DSA)

Q5. Which of the following sorting algorithm has a best time complexity of O(n log n)?

Tap an option, see immediate feedback, retry the wrong ones, and review the final correct answers at the end.

Questions

1

Answered

0

Score

0%

Continue answering

Q5 · Sorting

Which of the following sorting algorithm has a best time complexity of O(n log n)?

Not answered