Re: hc11 program help
From: Anthony Fremont (NOspam-me_at_houston.rr.com)
Date: 02/29/04
- Next message: Marc Randolph: "Re: difference btw H/W & S/W implementations !!"
- Previous message: Captain Rick: "Re: Example of subtraction with borrow?"
- Next in thread: Max: "Re: hc11 program help"
- Maybe reply: Mood: "Re: hc11 program help"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sun, 29 Feb 2004 21:53:12 GMT
"Max" <mtj2@btopenworld.com> wrote in message
news:gm8540pl7tcer2f13ituir8lif7vsdo7bo@4ax.com...
> On Sat, 28 Feb 2004 23:10:30 GMT, Anthony Fremont wrote:
>
> >The first example that I saw was simply inner and outer loops (N*N)
with
> >the comparison interval shrinking until it became 1, at which point
it
> >became an ordinary bubble sort. I must admit that I haven't seen it
> >mentioned much in any form, even though it's quite simple to
implement.
>
> It's really very well known and documented under the name "Shell
> sort". Don Shell first wrote it up in 1959, so it's got a loooong
> history.
Interesting. I've seen websites that do indeed suport this claim. I
saw reference to it for the first time in a Byte magazine article.
As indicated here: http://world.std.com/~jdveale/combsort.htm and here
http://en.wikipedia.org/wiki/Comb_sort
Shell is not referenced as having anything to do with its authorship at
all. Credit seems to go to Stephen Lacey and Richard Box. It would
appear that when refering to an insertion sort of decreasing comparison
intervals, one should say Shell sort. However, when referring to a
bubble sort with similar (same?) technique applied, it's a comb sort.
- Next message: Marc Randolph: "Re: difference btw H/W & S/W implementations !!"
- Previous message: Captain Rick: "Re: Example of subtraction with borrow?"
- Next in thread: Max: "Re: hc11 program help"
- Maybe reply: Mood: "Re: hc11 program help"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
|