-
Notifications
You must be signed in to change notification settings - Fork 1
/
Merging_two_Sub_Sorted_Arrays.c
55 lines (40 loc) · 1.05 KB
/
Merging_two_Sub_Sorted_Arrays.c
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
#include<stdio.h>
#include<stdlib.h>
void merging(int a[] , int b[] , int low , int mid , int high)
{
int i,j,k;
i = low;
j = mid+1;
k = low;
while(i <= mid && j <= high)
{
if(a[i] < a[j])
b[k++] = a[i++];
else
b[k++] = a[j++];
}
for( ; i <=mid ; i++)
b[k++]=a[i];
for( ; j <= high ; j++)
b[k++]=a[j];
}
int main()
{
int i,n,low,mid,high; //(high=high/last index) and (low=low/first index)
printf("\nEnter total number of elements of array : ");
scanf("%d",&n);
int a[n],b[n];
printf("\nEnter elements of array :\n");
for(i=0 ; i < n ; i++)
scanf("%d" , &a[i]);
printf("\nEnter starting-index of sub-sorted array : ");
scanf("%d",&low);
printf("\nEnter last-index of sub-sorted array : ");
scanf("%d",&mid);
high=n-1;
merging(a , b , low , mid , high);
printf("\n\nMerged array is : \n");
for(i=0 ; i < n ; i++)
printf("%d " , b[i]);
return 0;
}