Implement Merge Sort algo
AnswerBot
8mo
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges the sorted halves.
Divide the array into two halves
Recursively sort ea...read more
Help your peers!
Add answer anonymously...
Top LendingKart Intern interview questions & answers
Popular interview questions of Intern
Top HR questions asked in LendingKart Intern
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