Algorithms_interview/Inplacemerge.cpp at master · iampiyush/Algorithms_interview · 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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
// Find common Elements in Two sorted
//  time complexity   0(n2)...
//  space complexity   0(1)....


#include<iostream>
//#include<cwindows>
#include<cstdio>
#include<ctime>
#include<unistd.h>

using namespace std;


// swap two variables...

void swap(int &x,int &y)
{
 int temp;
 temp=x;
 x=y;
 y=temp;
}


void printArray(int arr[],int size)
{
 if(size<1)
 {
  cout<<"Wrong Array size "<<endl;
  return ;
 }
 int i;

 for(i=0;i<size;i++)
  cout<<arr[i]<<" ";

 cout<<endl;

}


void printCommanElements(int a[],int b[],int size)
{
 int buffer[size+1];
 int i,j;
 int k=0;

  i=0;
  j=0;
  while(i<size && j<size )
  {
   if(a[i]>b[j])
    j++;
   else if(a[i]<b[j])
    i++;
   else
   {
    buffer[k]=a[i];
    i++;
    j++;
    k++;
   }
  }


  cout<<"K is "<<k<<endl;
  for(i=0;i<k;i++)
   cout<<buffer[i]<<" ";


  return ;
}


int main()
{
int a[100];
int b[100];
int t,size,i;

cin>>t;
while(t--)
{
 cin>>size;

 for(i=0;i<size;i++)
  cin>>a[i];

 for(i=0;i<size;i++)
  cin>>b[i];


  //printArray(a,size);
  //printArray(b,size);

  cout<<"Inplace Merge \n";
  //sleep(1000);
/*
  for(i=0;i<900000000;i++);
   cout<<" ..";
  for(i=0;i<900000000;i++);//sleep(1000);
   cout<<" ..";
  for(i=0;i<900000000;i++);//sleep(1000);
   cout<<" ..";
  for(i=0;i<900000000;i++);//sleep(1000);
   cout<<" ..";
*/

 // cout<<endl;
  printCommanElements(a,b,size);

  //printArray(a,size);
  //printArray(b,size);

}


 return 0;
}