A typical bit array shops kw bits, where w is the number of bits in the unit of storage, such as a byte or word, and K is some nonnegative integer. A bit array (also known as bit map, bit set, bit string, or bit vector) is an array data structure that compactly shops bits.

COMING SOON!

```
#include <iostream>
int main()
{
int i, j, m, n;
cout << "Enter size of array 1:";
cin >> m;
cout << "Enter size of array 2:";
cin >> n;
int a[m];
int b[n];
cout << "Enter elements of array 1:";
for (i = 0; i < m; i++)
cin >> a[i];
for (i = 0; i < n; i++)
cin >> b[i];
i = 0;
j = 0;
while ((i < m) && (j < n))
{
if (a[i] < b[j])
i++;
else if (a[i] > b[j])
j++;
else
{
cout << a[i++] << " ";
j++;
}
}
return 0;
}
```