Quoting Jonas Melian <[EMAIL PROTECTED]>: > Thank you very much!. > > I didn't want to make it using the old-style programming because it's > more large and I'm supposed that slower that using a list comprehension > solution.
Well, we can investigate, to find out the truth :-) Hopefully you can read the attached file. Here are my results: $ python sorttest.py John 1:[5.324422796752101, 6.9189729420918029, 6.771758421810592] John 2:[3.4790142322557749, 3.4373198269612502, 3.392254322825945] Kent:[29.745739472474856, 42.376246143015386, 38.031272689685423] (each time represents 100,000 reps) -- John.
_______________________________________________ Tutor maillist - Tutor@python.org http://mail.python.org/mailman/listinfo/tutor
