Sorting algorithms are the ones used by programmers to sort elements in an array based on the need for programmer.There are many sorting algorithms that can help programmer to perform this task such asBubble sort,Insertion sort,Selection sortetc.Adding to this list is the Merge sort algorithm which sorts the elements in an array by splitting the array in to chunks and then merging them in the sorted form.
Merge sort Algorithm explained:
When sorting an array using Merge sort algorithm the array will be divided into equal partitions.Then the elements in the array are merged by sorting the elements and positioning them in right order to get a fully sorted array.To explain this better take a look at the below example
Let us consider the following array and sort the elements in the ascending order using merge sort.
Now the array with eight elements divided into two partitions with four elements in each partition.
Now both the partitions are again divided into equal partitions as the numbers in both the partitions are not sorted.
Again the four partitions are divided into eight as a single block with one number
Now, every number is merged by comparing it with the other and based on the order they are copied accordingly into the new block.
To merge these blocks every element in the first block is compared with all the other elements in the second block and are placed accordingly in the sorted order in the new merged block.
Now the comparison of elements with other set are done and elements are placed accordingly, in the new merged block
Finally after comparison each and every element with other two merged blocks are obtained
The blocks are merged by comparing each and every element of the block with all the elements of another block and are placed accordingly in the final block.
The comparison of the elements is done recursively in the similar way and finally the list of numbers in the array is obtained in the sorting order.
Steps to implement Merge sort Algorithm:
- Let us consider array A[0…..n-1].Split this array A into two equal partitions and consider the two partitions as array B and C.
- Split the arrays B and C recursively until an array with one element is obtained.
- Now merge the two arrays of single elements, by comparing all the numbers in one block with all the elements in the another block and the elements are placed accordingly in the merged block based on ascending order sorting obtained by comparison.
- Now this method of sorting elements by comparing and merging has to be done recursively.
- Finally the array A[0…..n-1] with the numbers in the ascending order will be obtained
Sample code:
#include
void mergesort(int a[],int i,int j)!void merge(int a[],int i1,int j1,int i2,int j2)!int main() { int a[30],n,i!printf("Enter no of elements to sort:")!scanf("%d",&n)!printf("Enter the elements:")!for(i=0;i
Try this out:
- Use merge sort algorithm to sort 11 elements in an array.
Related Posts:
