Merge sort algorithm
AnswerBot
1y
Merge sort is a divide-and-conquer algorithm that recursively divides an array into two halves, sorts them, and then merges them.
Merge sort has a time complexity of O(n log n).
It works by dividing the...read more
Help your peers!
Add answer anonymously...
Popular interview questions of Student Intern
>
Cube Highways and Transport Assets Advisors Student Intern Interview Questions
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
