array contains 2n numbers like a1a2a3a4a5...anb1b2b3...bn
i want the array in such a way that a1b1a2b2a3b3.....anbn
in O(n) time complexity and O(1) space complexity..
i got with O(nlogn) complexity...
is it possible ?
--~--~---------~--~----~------------~-------~--~----~
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.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
- [algogeeks] hi..plz solve this.. subrahmanyam kambala
- [algogeeks] Re: hi..plz solve this.. Arunachalam
- [algogeeks] Re: hi..plz solve this.. Vishal
- [algogeeks] Re: hi..plz solve this.. Arunachalam
- [algogeeks] Re: hi..plz solve this.. Siva
- [algogeeks] Re: hi..plz solve this.. Arunachalam
- [algogeeks] Re: hi..plz solve this.. Googmeister
- [algogeeks] Re: hi..plz solve this.. L7
- [algogeeks] Re: hi..plz solve this.. L7
- [algogeeks] Re: hi..plz solve this.. Ranjit
- [algogeeks] Re: hi..plz solve this.. Munish Goyal