Test your Programming knowledge

50% users failed to get the best score. It's your turn to test now.
Questions curated by the expert mentors at codzify.com

Start Quiz

Article

Merge Sort - Codzify.com

2 mins 51 sec read

What is merge sort ?

Merge sort is divide and conquer sorting algorithm . Merge procedure is the heart of algorithm. Given two sorted arrays of size M & N, merge procedure will create a new sorted array of size M + N.

How Merge Sort works ?

Consider an array of 5 elements (2,5,4,1,3) . Merge sort can be visualised in three phases :

1) Divide.

2) Conquer.

3) Combine.



1) In the given example, the given array is split into two smaller arrays. Now, these two smaller arrays will recursively split themselves further into smaller arrays till only one element is left in an array. This phase is called as Divide Phase. In the given diagram, as you can see on the fourth step, each element is split in its own individual array.

2) Now in Conquer Phase merge procedure will combine these arrays in ascending order.

3) Now in Combined Phase these smaller sorted arrays will merge together to form a single sorted array of original size.

Recommended Articles

Did you found this article helpful?

Try to execute what you have learnt

Easy to use online data structure compiler where you can execute the programs in your favourite programming language.
(C, C++, Python)

Open Compiler

HTML, CSS and Javascript Real time Web Editor

Execute your HTML, CSS and javascript code in real time with the web editor
(HTML, CSS, Bootstrap, Javascript)

Open Web Editor