← Capgemini questions

Working and code of merge sort

Filed under Capgemini

Explain the working of Merge Sort and provide its implementation. Merge Sort is a divide-and-conquer algorithm that recursively splits an array into halves, sorts them, and merges the sorted halves.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Capgemini questions

Collected from public candidate posts and coding forums. Updated Nov 2026.