What is the merge sort algorithm and what is its time complexity?
AnswerBot
1mo
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges them back together.
Divide the input array into two halves
Recursively ...read more
Help your peers!
Add answer anonymously...
Popular interview questions of Intern
>
Siemens Industry Software (India) 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
