Quick and merge time complexity and when worst case happens in quick sort
AnswerBot
7mo
Quick sort has O(n log n) time complexity on average, O(n^2) worst case. Merge sort has O(n log n) time complexity always.
Quick sort has an average time complexity of O(n log n) due to its divide-and-...read more
Help your peers!
Add answer anonymously...
Top Nagarro Associate Engineer interview questions & answers
Popular interview questions of Associate Engineer
Top HR questions asked in Nagarro Associate Engineer
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
