[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [RRG] simplicity
- To: "Lixia Zhang" <lixia@cs.ucla.edu>
- Subject: Re: [RRG] simplicity
- From: "William Herrin" <bill@herrin.us>
- Date: Wed, 2 Apr 2008 00:13:02 -0400
- Cc: rrg <rrg@psg.com>
- Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=beta; h=message-id:date:from:sender:to:subject:cc:in-reply-to:mime-version:content-type:content-transfer-encoding:content-disposition:references:x-google-sender-auth; b=DFQyfANMkNX5uMXkZiAQ64bxbs02POFupO7peIpl4wNrC2a1QQQj0V/aKJX0PZIhzYIUezJdAi49YZ5JfpAlOI1okc/uYnEDJtLEhR3LXC9oNxkJhfCyuX28dLNFEpC4BwPd8FDHo2PcQ2nVwecSWQZDXn7hpv3boeUAHHdcOic=
- In-reply-to: <56EDA6A8-91C1-4A1B-A493-412197C3E93F@cs.ucla.edu>
- References: <56EDA6A8-91C1-4A1B-A493-412197C3E93F@cs.ucla.edu>
On Tue, Apr 1, 2008 at 10:31 PM, Lixia Zhang <lixia@cs.ucla.edu> wrote:
> C. A. R. Hoare is a British computer scientist, probably best known
> for the development of Quicksort (or Hoaresort), the world's most
> widely used sorting algorithm, in 1960. One of his famous quotes is
>
> "There are two ways of constructing a software design:
> make it so simple that there are obviously no deficiencies,
> and make it so complicated that there are no obvious deficiencies."
Quicksort fits the latter category, yes?
Bit of a merge-sort fan myself. It may not be cool, but it buys
stability, sequential access and evenly distributed parallelism with
less complexity and pretty much the same n log n price. In practice,
the 2n space complaint normally falls apart with a sensible use of
pointers.
Regards,
Bill Herrin
--
William D. Herrin ................ herrin@dirtside.com bill@herrin.us
3005 Crane Dr. ...................... Web: <http://bill.herrin.us/>
Falls Church, VA 22042-3004
--
to unsubscribe send a message to rrg-request@psg.com with the
word 'unsubscribe' in a single line as the message text body.
archive: <http://psg.com/lists/rrg/> & ftp://psg.com/pub/lists/rrg