Template:Did you know nominations/Linear probing
- The following is an archived discussion of the DYK nomination of the article below. Please do not modify this page. Subsequent comments should be made on the appropriate discussion page (such as this nomination's talk page, the article's talk page or Wikipedia talk:Did you know), unless there is consensus to re-open the discussion at this page. No further edits should be made to this page.
The result was: promoted by Cwmhiraeth (talk) 14:57, 14 April 2016 (UTC)
| DYK toolbox |
|---|
Linear probing
[edit]- ... that Donald Knuth's analysis of the linear probing strategy for resolving collisions in hash tables has been called "a landmark in the analysis of algorithms"?
- Reviewed: Cynthia Larive
Improved to Good Article status by David Eppstein (talk). Self-nominated at 00:24, 7 April 2016 (UTC).
New enough and long enough as a recently promoted GA; article is neutral and is free of copyvio or close paraphrasing; hook statement is cited (and is verifiable by google, but adding the ISBN to the ref would be useful); QPQ done. Good to go. Opabinia regalis (talk) 04:36, 10 April 2016 (UTC)
