Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!pacific.mps.ohio-state.edu!linac!att!rutgers!cmcl2!uupsi!sunic!cs.umu.se!dvljrt From: dvljrt@cs.umu.se (Joakim Rosqvist) Newsgroups: comp.sys.amiga.programmer Subject: Re: Combsort algorithm Message-ID: <1991May13.114208.18177@cs.umu.se> Date: 13 May 91 11:42:08 GMT References: <191d6f59.ARN12eb@pilhuhn.ka.sub.org> Sender: news@cs.umu.se (News Administrator) Organization: Dep. of Info.Proc, Umea Univ., Sweden Lines: 16 In article <191d6f59.ARN12eb@pilhuhn.ka.sub.org> hwr@pilhuhn.ka.sub.org (Heiko W.Rupp) writes: >> In article mwm@pa.dec.com (Mike (My Watch Has Windows) Meyer) writes: >> >> > A closer-to-fair comparison would be to write your own quicksort for >> > sorting a fixed-size array of known object types. I cheated, and >> >[...] >> > comb-sort of 100000 elements: 42.46 seconds >> > qsort of 100000 elements: 27.12 seconds >> >In the articles you will see, that Quicksort ist the fastest comparision- >based sorting algorithm on the average, but it may take O(n*n) in the Has anybody timed Quicksort in assembler? I just made a comb-sort that will sort 100000 integers in 18.5 sec /$DR.HEX$