Use a set ADT ( C++ STL). Traverse the entire 2d matrix and keep on adding each element to the set. The set ADT stores, sorts and removes redundant data values and you get sorted list after traversal. Now again traverse the set ADT and store it in an array.
On Wed, Jan 9, 2013 at 4:53 PM, Karthikeyan V.B <[email protected]> wrote: > Merge pairs of rows until u get a single row, while merging remove the > duplicates > > -- > > > --
