Hi all
I have to merge two arrays having duplicates into the third array without duplicates.
I am trying to implement this by binary tree implementation in which if there is repeated element it will return.
I want simple merging with less loops or iteration( sorting is not required so I skip merge sort method).
Can anybody suggest me some methods with least looping. Currently I am going with Binary tree but if anybody has much better idea, it will be very helpful.
example:
Code:
int a[]= { 11,12,13,14,15};
int b[]= {11,12,45,32,13,55,67,34};
int final_arr[]= {11,12,13,14,45.32.67.34.15.55};
Thanks