Sort one sequence by O(n) in time and O(1) in space

Wesley nispray at
Sun Feb 9 13:13:50 CET 2014

Hi guys,
   Here is one question related to algorithm.
Details here:

here is input sequence like a1,a2,...,an,b1,b2,...,bn ,the ax and bx always exist in pair. So, now, how to change the sequence to a1,b1,...,an,bn, with time complexity as O(n) and space as O(1).

Any comments will be appreciated.

More information about the Python-list mailing list