Merging integer array without duplicates.

**nickman** · 08-22-2010

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

**laserlight** · 08-22-2010

Using a balanced binary tree to implement a set is certainly a correct idea. However, you may find it easier to simply concatenate the two arrays, sort the result, and then eliminate consecutive duplicates. Or, you can sort each of the input arrays, then perform a merge that skips duplicates.

**nickman** · 08-22-2010

Thanks for reply...

I have some queries for merging:

1) how would be I'll knowing the size of final array to be created. Or should I preassumes to allocate a size equal to some of a & b array. In this I'll be ended by extra memory wastage.

Thanks

**laserlight** · 08-22-2010

You first allocate enough space on the assumption that there are no duplicates. After all is done, you can always realloc() to the desired size.

**nickman** · 08-22-2010

Thanks...

I have wrote following code and it merging but giving segmentation fault at last.

I have taken third array as:

Code:

int c[] = {};

As think that declaring array c like this, we can add any number of elements to it.

Please clarify and help me to correct problem.

Thanks

**laserlight** · 08-22-2010

Err... I am not sure about that. A quick check with the MinGW port of gcc 3.4.5 shows that the empty initialiser is a compiler extension, even with respect to C99. I have no motivation to check the standard right now, so I'll just tell you that the typical approach here is to use dynamic memory allocation with functions from <stdlib.h> such as malloc(), realloc() and free().

Thread: Merging integer array without duplicates.

Thread Tools

Search Thread

Display

Merging integer array without duplicates.

Similar Threads

Convert Integer to Hex in an array of chars

Dynamic array of structures containing yet another dynamic array of structures

question about multidimensional arrays

Unknown Memory Leak in Init() Function

Struct *** initialization