Computer Science and Engineering › Sorting algorithm › Question #5694
Single Choice Easy

QWhat is the time complexity of the best sorting algorithms?

ID: #5694 Sorting algorithm 230 views
Question Info
#5694Q ID
EasyDifficulty
Sorting algorithmTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A O(n) ✔ ✖
  • B O(n log n) ✔ ✖
  • C O(n^2) ✔ ✖
  • D O(log n) ✔ ✖
Correct Answer

Explanation

O(n log n)
 Continue Practice
Previous Question Next Question
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

Which of the following sorting algorithms is not a comparison-based algorithm?... What is a sorting algorithm?... Which of the following sorting algorithms is often used as a subroutine in other sorting algorithms?... Which of the following sorting algorithms works by repeatedly selecting the minimum element from the unsorted part of the array and putting it at the beginning of the sorted part?... Which of the following is a comparison-based sorting algorithm?... Which of the following sorting algorithms is stable?... Which of the following sorting algorithms is not an in-place algorithm?... Which of the following sorting algorithms has the worst time complexity for most inputs?... Which of the following sorting algorithms has the best worst-case time complexity?...