Q. Which of the following algorithms has the worst-case time complexity of O(n log n)?

निम्नलिखित में से किस एल्गोरिदम में O(n log n) की सबसे खराब स्थिति वाली समय जटिलता है?

A
Selection Sort
B
Merge Sort
C
Bubble Sort
D
Linear Search

Explanation

Explanation will be available soon. Please stay tuned.

व्याख्या जल्द ही उपलब्ध होगी। कृपया बने रहें।

Invest in Future Achievers

Your support helps keep Exam Achiever 100% free for students preparing for exams.

Thanks for your support!

More From This Topic

Related Questions

Related Topics

Analysis of Algorithms Graphs Stacks and Queues Basics of C++ and There Classes & Object Searching and Sorting Algorithms

Comments

Leave a Comment

Invest in Future Achievers

Your support helps keep Exam Achiever 100% free for students preparing for exams.

Thanks for your support!

People Also Search For

Illustration of a clipboard with a checklist and pencil, bright and colorful style

Ready for a Challenge?

Take our Free timed mock tests to sharpen your skills and boost your confidence!