Physics · Algorithms

A sorting technique is called 'stable' if:

Verified Solution4 OptionsUpdated: October 2026👁️1 View

1It takes O(n log n) time in the worst case.
2It uses the divide-and-conquer strategy.
3The relative order of records with equal keys is maintained.✓
4It takes exactly O(n) auxiliary space.

Correct answer

The relative order of records with equal keys is maintained.

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 Physics?

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

Start Free Mock Test →

Chapter Practice

Want more practice questions on Algorithms?

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

Practice Algorithms MCQs →

Recommended practice questions in Physics · Algorithms

Browse More Physics →

Which Indian independence movement leader was primarily known for his philosophy and practice of non-violent civil disobedience?

Solve Question→

Who gave the call for 'Do or Die' during the Quit India Movement in 1942?

Solve Question→

Which of the following revolutionary pairs were imprisoned together in Cellular Jail and faced harsh conditions, contributing significantly to the Indian independence movement?

A sorting technique is called 'stable' if:

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Physics?

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions

A sorting technique is called 'stable' if:

Download Single Question PDF

Share with Friends & Study Groups

Preparing for Physics?

Related Practice Questions

Practice by Subject

Practice by Exam

Topic-Wise Solved Questions