📌Highlight: Hi Friends ! In this post I am going to explain about the concept of merge sort ,Also discuss about their algorithm and function with some example.
Merge sort is based on divide and conquer strategy in which first we try to divide array of N elements to N - sorted array of single elements then merging process merge these sorted array into one sorted array.
Let we understand by the help of an example:
Suppose we have an array of 8 elements such as:
Now we want to sort these elements using merge sort.
