Merge Sort Hi there, I am back with another article on one of the most important algorithms in the world of DSA. In this article we would be covering Merge Sort and talk about its various aspects. So, without wasting much time let's jump into the topic right away. Merge sort is another type of sorting algorithm whose time complexity is O(N*logN) . The worst, average and best time complexity of merge sort always remains same , that is, O(N*logN) . You must be thinking why the time complexity is same for all cases. Well, the answer to that we will get as we move further in our discussion. It works on divide and conquer technique, where the given array is divided into smaller somebodies of two halves and then sorting is done. Source Code: conquer()  function: divide( ) function: main( ) function: Output: #1  In the above example, user first enters the length of the array, and then the array elements. The highlighted part are the elements of array after sorting. #2 Let's take ano...