Asked in LTIMindtree
What is the time and space complexity of merge sort?
AnswerBot
6mo
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 Graduate Engineer Interview Questions Asked at LTIMindtree
Q. Write code to perform matrix multiplication.
Q. What are some real-life examples that illustrate the concepts of Object-Oriented...read more
Q. What is the thread lifecycle in programming?
Interview Questions Asked to Graduate Engineer at Other Companies
Top Skill-Based Questions for LTIMindtree Graduate Engineer
C++ Interview Questions and Answers
300 Questions
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Networking Interview Questions and Answers
250 Questions
Stay ahead in your career. Get AmbitionBox app
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.
Follow Us
