cpp-codes/Arrayleet2.cpp at master · abhinavkumaryadav1/cpp-codes · 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<iostream>
using namespace std;
int main()
{
int m,n;
cout<<"enter the sizes of array num1 and num2;"<<endl;
cin>>m>>n;
int c=m+n;
float num1[m];
float num2[n];
float merge[m+n];
int i=0,j=0,k=0;
cout<<"enetr the elements of num1 array in ascending order"<<endl;
while(i<m)
{
    cin>>num1[i];
    ++i;
}
cout<<"enetr the element of the second array in ascending order"<<endl;
while(j<n)
{

    cin>>num2[j];
    ++j;
}


for(i=0,j=0,k=0;i<m&&i<n;k++)
{
if (num1[i]==num2[j])
{
    merge[k]=num1[i];
    merge[k+1]=num2[j];
    ++k;
    ++i;
    ++j;
}

else if(num1[i]<num2[j])
{
    merge[k]=num1[i];
    ++i;
}

else
{
    merge[k]=num2[j];
    ++j;
}

}

while(i<m)
{
    merge[k]=num1[i];
    ++i;
    ++k;
}
while(j<n)
{
    merge[k]=num2[j];
    ++k;
    ++j;
}

if(c%2==0)
{

c=c/2;

cout<<"value of median "<<(merge[c]+merge[c-1])/2.0;
}

else
{

     c=c/2;

    cout<<"value of median  "<<merge[c];
}

    return 0;
}