What is the best sorting technique to sort almost sorted list? Justify your answer.
Explanation
Timsort has a worst-case time complexity of O(n log n) and a best-case time complexity of O(n), making it suitable for almost sorted lists.
⬆ Related Topic
📘 Syllabus
View KERALA UNIVERSITY Class 3 Syllabus →
📝 Practice Questions
Practice Previous Year Questions →
🤖 Practice with AI
Generate Practice Question Paper →
📚 Related Concepts
- What are the factors that affect the Radar range?
- What is a pure substance?
- (c) What is meant by interlocking of signals and points? List down any three essential regulations.
- (e) What are the important wave characteristics? Write down the inter- relationship among these characteristics.
- (b) What are the requirement of sleepers used in a railway track? Using a sleeper density $\mathrm{N}+5$, determine the