Computer Science · Sorting Algorithms

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

Verified Solution4 OptionsUpdated: October 2026👁️1 View

1Selection sort
2Insertion sort
3Quicksort
4Heapsort✓

सही उत्तर देखें

Heapsort

Download Single Question PDF

Save this question and verified answer as a clean study sheet with live clickable link.

👥

Share with Friends & Study Groups

Challenge your peer aspirants on WhatsApp or Telegram to solve this question!

Online Test Series

Preparing for Computer Science?

Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.

Attempt Sorting Algorithms MCQs →All Mock Tests

Chapter Practice

Want more practice questions on Sorting Algorithms?

Solve complete topic-wise tests with detailed solutions on GkGet.

Practice Sorting Algorithms MCQs →

Recommended practice questions in Computer Science · Sorting Algorithms

Browse More Computer Science →

Which of the following sorting algorithms does NOT have a worst-case time complexity of O(n2)?

Solve Question→

An array of 7 elements, all distinct, is nearly sorted and requires only one element to be moved to complete the sorting using insertion sort. What is the maximum number of comparisons needed?

Solve Question→

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

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions

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

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Computer Science?

Related Practice Questions

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions