Re: Sort comparison

On Tue, May 1, 2012 at 11:52 AM, Ian Kelly wrote: > On Tue, May 1, 2012 at 12:00 PM, Dan Stromberg > wrote: > > > > On Tue, May 1, 2012 at 12:21 AM, Ian Kelly > wrote: > >> > >> On Mon, Apr 30, 2012 at 11:25 PM, Dan Stromberg > >> wrote: > >> > > >> > A while back I did a sort algorithm runtim

Re: Sort comparison

On Tue, May 1, 2012 at 12:00 PM, Dan Stromberg wrote: > > On Tue, May 1, 2012 at 12:21 AM, Ian Kelly wrote: >> >> On Mon, Apr 30, 2012 at 11:25 PM, Dan Stromberg >> wrote: >> > >> > A while back I did a sort algorithm runtime comparison for a variety of >> > sorting algorithms, and then mostly s

Re: Sort comparison

On Tue, May 1, 2012 at 10:51 AM, Terry Reedy wrote: > On 5/1/2012 1:25 AM, Dan Stromberg wrote: > > Anyway, here's the comparison, with code and graph: >> http://stromberg.dnsalias.org/**~strombrg/sort-comparison/ >> >> (It's done in Pu

Re: Sort comparison

On Tue, May 1, 2012 at 12:21 AM, Ian Kelly wrote: > On Mon, Apr 30, 2012 at 11:25 PM, Dan Stromberg > wrote: > > > > A while back I did a sort algorithm runtime comparison for a variety of > > sorting algorithms, and then mostly sat on it. > > > > Recently, I got into a discussion with someone o

Re: Sort comparison

On 5/1/2012 1:25 AM, Dan Stromberg wrote: Anyway, here's the comparison, with code and graph: http://stromberg.dnsalias.org/~strombrg/sort-comparison/ (It's done in Pure python and Cython, with a little m4). Interesting, BTW, that an unstable quicksort in Cython was approaching timsort as a C

Re: Sort comparison

On Mon, Apr 30, 2012 at 11:25 PM, Dan Stromberg wrote: > > A while back I did a sort algorithm runtime comparison for a variety of > sorting algorithms, and then mostly sat on it. > > Recently, I got into a discussion with someone on stackoverflow about the > running time of radix sort. > > I real