Home Original page

NaN, Null, and Sorting

Chris Angelico rosuav at gmail.com
Mon Jan 16 05:57:59 EST 2012 
On Mon, Jan 16, 2012 at 9:22 PM, Eelco <hoogendoorn.eelco at gmail.com> wrote:
> What you want, conceptually, is a
> sorted list of the sortable entries, and a seperate list of the
> unsorted entries. Translated into code, the most pure solution would
> be to filter out the nanas/nulls in their own list first, and then
> sort the rest. If the interface demands it, you can concatenate the
> lists afterwards, but probably it is most convenient to keep them in
> seperate lists.

So... you split it into two lists, sort the two lists (one of which
can't be sorted), and then concatenate them. Sounds like the quicksort
algorithm.

ChrisA
More information about the Python-list mailing list