Answer to Question #177740 in Algorithms for Glenn

Question

Sort the following elements using merge sort technique 

using the Divide and Conquer strategy. {12,45, 6, 18, 10, 4, 3, 1, 13, 15, 16}

Answer 1

Merge Sort is a Divide and Conquer algorithm which divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves.

the array is recursively divided in two halves till the size becomes 1. Once the size becomes 1, the merge processes come into action and start merging arrays back till the complete array is merged.