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

Wesley nispray at gmail.com
Mon Feb 10 03:09:47 CET 2014


> > 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).
> 
> 
> 
> The two halves of the list are already sorted, yes? 

[Wesley] No, not sorted yet..



More information about the Python-list mailing list