Time and space complexity of merge sort.
AnswerBot
2mo
Merge sort has a time complexity of O(n log n) and a space complexity of O(n).
Time complexity of merge sort is O(n log n) where n is the number of elements in the array.
Space complexity of merge sort ...read more
Help your peers!
Add answer anonymously...
Top LTIMindtree Graduate Engineer interview questions & answers
Popular interview questions of Graduate 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
