Merge Sort
Merge sort algorithm: Given a list L with a length K: If k==1 the list is sorted else
# include <stdio.h> #include <conio.h> void merge (int numbers [], int temp[], int left, int mid , int right); void merge sort (int numbers[], int temp[], int array-size); void m-sort( int numbers[],int temp[],int left, int right); void merge-sort ( int numbers [],int temp, int array-size); { m-sort(numbers,temp,0,array-size-1); } void m-sort(int numbers[],int temp[],int left, int right) { int mid; if(right>left) { mid = (right +left)/2; m-sort (numbers, temp, left,mid); m-sort(numbers temp,mid+1,right); merge(numbers,temp,left,mid+1,right); } /*merge*/ void merge(int numbers[],int temp[],int left, int mid, int right) { int i,left-end,num-elements,Emp-pos; left-end =mid-1; emp-pos-left; num-elements =right-left+1; while ((left<=left-end)&& (mid<=right)) { if(numbers[left]<=numbers[mid]) { temp[temp-pos]=numbers[left]; tmp-pos = tmp-pos+1; left=left+1; else {temp[tmp-pos]= numbers [mid]; tmp-pos=tmp-pos+1; mid=mid+1; } } while( left <= left-end) { temp (tmp-pos]= numbers[left]; left=left+1; tmp=pos=tmp=pos+1; } while(mid <=right) { temp[tmp-pos]= numbers[mid]; mid=mid+1; tmp-pos=tmp-pos+1; } for(i=0;i<=num-elements;i++) { numbers [right ]= temp[right]; right =right-1; } } void main() { int a[20],b[20],n,i; printf(“Enter the value of n:\n”); scanf(“%d”,&n); printf(“Enter n elements :\n”); for (i=0;i<=n;i++) { scanf(“%d”,&a[i]); } merger sort(a,b,n); printf (“Sorted elements are :\n”); for (i=0;i<n;i++) { printf(“%d”,a[i]); } } OUTPUT: Enter the value of n:8 Enter n elements: 18 26 32 6 43 15 9 1 sorted elements are: 1 6 9 15 18 26 32 43 Example:
You liked the article?
Like : 0
Vote for difficulty
Current difficulty (Avg): Medium
1/15
TekSlate is the best online training provider in delivering world-class IT skills to individuals and corporates from all parts of the globe. We are proven experts in accumulating every need of an IT skills upgrade aspirant and have delivered excellent services. We aim to bring you all the essentials to learn and master new technologies in the market with our articles, blogs, and videos. Build your career success with us, enhancing most in-demand skills in the market.
Stay Updated
Get stories of change makers and innovators from the startup ecosystem in your inbox