AnswerBot
9mo
Merge sort is a divide and conquer algorithm that recursively splits an array into halves, sorts them, and then merges them back together.
Merge sort is efficient for sorting large arrays.
It has a time...read more
Help your peers!
Add answer anonymously...
Popular interview questions of SDE
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