From: Florian Weimer <fw@deneb.enyo.de>
Subject: Re: Smart sorting algorithm ?
Date: Tue, 02 Jul 2002 22:48:40 +0200
Date: 2002-07-02T20:48:32+00:00 [thread overview]
Message-ID: <8765zxx3dj.fsf@deneb.enyo.de> (raw)
In-Reply-To: 3D21DC25.AD402F70@easystreet.com
achrist@easystreet.com writes:
> Using, e.g., qsort, isn't it true that this should not happen? If
> you've compared A vs B and B vs C, then B is the pivot, and A and C
> are on opposite sides of the pivot and won't get compared.
Quicksort performs quite a lot of comparisons (for an O(n log n)
algorithm, of course). It gains its speed from the tightness of its
inner loop, not from saving comparisons.
next prev parent reply other threads:[~2002-07-02 20:48 UTC|newest]
Thread overview: 28+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-07-02 16:32 Smart sorting algorithm ? Wes Groleau
2002-07-02 17:00 ` achrist
2002-07-02 20:00 ` Wes Groleau
2002-07-02 21:57 ` achrist
2002-07-02 22:22 ` Wes Groleau
2002-07-02 22:57 ` achrist
2002-07-03 14:25 ` Wes Groleau
2002-07-08 17:36 ` Ron
2002-07-02 20:48 ` Florian Weimer [this message]
2002-07-02 17:21 ` Wilhelm Spickermann
2002-07-02 20:01 ` Wes Groleau
2002-07-02 20:22 ` Tarjei T. Jensen
2002-07-06 13:40 ` Robert Dewar
2002-07-02 18:57 ` Florian Weimer
2002-07-02 20:08 ` Wes Groleau
2002-07-08 21:54 ` Wes Groleau
2002-07-09 4:35 ` Robert Dewar
2002-07-09 7:51 ` tmoran
2002-07-09 14:48 ` Ron
2002-07-10 14:38 ` Wes Groleau
2002-07-10 18:08 ` tmoran
2002-07-10 22:14 ` Wes Groleau
2002-07-09 18:59 ` Ron
2002-07-11 14:40 ` Wes Groleau
2002-07-11 20:04 ` Robert Dewar
2002-07-15 19:37 ` Wes Groleau
2002-07-15 22:08 ` achrist
-- strict thread matches above, loose matches on Subject: below --
2002-07-02 17:50 Gautier direct_replies_not_read
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox