Hacker News new | past | comments | ask | show | jobs | submit login

> Instead of repeating yourself, can you link to some actual information?

> I gave the reference, D. Knuth's famous book.

I just Ctrl+F'd "Gleason" in The Art of Computer Programming Vol 1, Vol 2, Vol 3, Vol 4A, and Vol 4B, with no hits in any of the 5 books.

I even looked in the glossaries. There's lots of last names -- Glaisher, Glassey, Gnedenko -- and no "Gleason".

I'm tempted to side with this iteration of CyberD's brutal takedowns on this one. :D

---- EDIT ----

WAIT: I found it in the glossary of Vol 3!

"Gleason, Andrew Mattei, 193, 648."

For this one, case sensitivity got me when I searched "gleason"!

The most relevant bit here seems to be page 193, discussing ways to minimize the average number of comparisons:

```

The minimum possible average number of comparisons, obtained by dividing by N, is never less than lg N and never more than lg N + 0.0861. [This result was first obtained by A. Gleason in an internal IBM memorandum (1956).]

```

"Gleason" is only mentioned in Vol 3.

"Gleason bound" is not used in Vol 3, which must be why it doesn't pop up on Google.

CyberD: now on the backfoot

graycat's startup: in talks for VC funding




That's great that you found actual information, but that doesn't seem to back up this person's bizarre claims that 'nothing beats heapsort'.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: