Array ( [0] => [1] => questions [2] => Popular-Algorithms [3] => Merge-Sort ) Popular Algorithms | Merge Sort | THE INQUISITIVE






Merge Sort

LEVEL:Beginner

Description

Given a list of integers and a integer (size of array). Sort the given array using Merge Sort Algorithm.

Input Format

First line contains the size of array (n) followed by n integers separated by spaces.

Output Format

Print the sorted array separated by spaces.


Example 1:

Input
5
32 12 4 64 100
Output
4 12 32 64 100
Example 2:

Input
6
96 54 100 32 45 64
Output
32 45 54 64 96 100
Example 3:

Input
6
69 95 343 455 62 44
Output
44 62 69 95 343 455

oops

Login to see Discussion




Approach

Step-i) if it is only one element in the list it is already sorted, return.
Step-ii) divide the list recursively into two halves until it can no more be divided.
Step-iii) merge the smaller lists into new list in sorted order.

Time Complexity: O(n*Log n)
Space Complexity: O(n)


Note :

Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.

oops

Login to see Solution






     Recommended Questions      

Topic: Popular Algorithms

Beginner

1. Binary Search2. Linear Search3. Fibonacci Search4. Bubble Sort5. Insertion Sort6. Selection Sort7. Quick Sort8. Merge Sort9. Addition of two matrixes10. Subtraction of two matrixes11. Multiplication of two matrixes12. Transpose of given Matrix13. EUCLIDIAN GCD ALGORITHM14. Fabinocci Numbers with matrix multiplication15. Fast Exponential16. Modular inversion17. Prime seiving18. Heap(using array)19. Heapify20. Heap Sort21. Linear Probing22. Open Addressing23. Collision Avoidance24. Binary Search Tree Traversal Techniques25. Finding Kth Largest Element in Binary Tree26. Diameter of a Binary search tree27. Depth of Binary Tree28. Number of Nodes in BST29. Convert Array to Binary Tree30. Convert Array to General Tree31. Lowest Common Ancestor