CPP-programs/mergesort.c at master · Sushmitha-Deva/CPP-programs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include<stdio.h>


void Merge( int beg , int end);
void MergeSort( int p,int q);

int a[100];

int main()
{

		int n;
    printf("\n Enter the size of the array");
    scanf("%d",&n);

 		printf("\n Enter the array");

 		for(int i=0; i<n;i++)
 			scanf("%d",&a[i]);

		MergeSort( 0,n-1);

		printf("\n Sorted array:\n");

		for(int i=0; i<n;i++)
 			printf(" %d ",a[i]);

return(0);

}

void MergeSort( int p,int q)
{
	int mid=(p+q)/2;

	if(p<q)
	{
			MergeSort(p,mid);
			MergeSort(mid+1,q);
			Merge(p,q);
	}

}


void Merge( int beg , int end)
{
	int mid=(beg+end)/2;
	int i=beg,j=mid +1,k=0;
	int b[100];

	while((i<=mid )&& (j<=end))
	{
			if(a[i]<a[j])
				{
				 	b[k]=a[i];
				 	i++;
				}
			else
				{
					b[k]=a[j];
					j++;
				}
		k++;
	}

	while(i<=mid)
	{
		b[k]=a[i];
		k++;
		i++;
	}
	while(j<=end)
	{
		b[k]=a[j];
		k++;
		j++;
	}

	for(i=beg;i<=end;i++)
		a[i]=b[i-beg];
}