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

Sturla Molden sturla.molden at
Mon Feb 10 11:20:33 CET 2014

Wesley <nispray at> wrote:
> [Wesley] This is not homework:-) 
> And actually I am new to algorithm, so you guys can feel free to say anything you want

In general, we cannot sort a sequence in O(n) time. O(n log n) is the lower
bound on the complexity.

More information about the Python-list mailing list