Can't we do an inplace sort by changing our comparison function?

On 10/10/06, ravi <[EMAIL PROTECTED] > wrote:

An array { A1, A2, A3, A4,.............,An, B1, B2,
B3,B4,.............,Bn } will be given, and we have to rearrange it as
{ A1, B1, A2, B2, A3, B3,..............}

Of course the greedy solution for this problem is that take another
array of size 2n and 2 pointers.

If space is the constraint then what is the solution for this type of
problems...




--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to