>>>>> Saketh <saketh.bhamidip...@gmail.com> (S) wrote:
>S> Why not use a dictionary instead of two lists? Then you can sort the >S> dictionary by value -- e.g. >S> d = dict(zip(items, values)) >S> sorted_items = sorted(d.iteritems(), key=lambda (k,v): (v,k)) >S> This produces a list of pairs, but demonstrates the general idea. This will fail if there are duplicates in the items. And if we assume no duplicates the key doesn't need the k part: sorted_items = sorted(d.iteritems(), key=lambda (k,v): v) or from operator import itemgetter sorted_items = sorted(d.iteritems(), key=itemgetter(1)) -- Piet van Oostrum <p...@cs.uu.nl> URL: http://pietvanoostrum.com [PGP 8DAE142BE17999C4] Private email: p...@vanoostrum.org -- http://mail.python.org/mailman/listinfo/python-list
