Difference between revisions of "Template:Did you know nominations/Binary search algorithm"
Jump to navigation
Jump to search
imported>David Eppstein m (dab) |
imported>Utcursch (good to go) |
||
| Line 23: | Line 23: | ||
--> | --> | ||
| − | :* | + | :* [[File:Symbol confirmed.svg|16px]] Promoted to GA status, long enough, neutral and well-sourced. No copyvios detected. Hook is interesting, sourced and less than <200 characters. QPQ not required. [[User:Utcursch|utcursch]] | [[User talk:Utcursch|talk]] 03:59, 22 May 2016 (UTC) |
}}<!--Please do not write below this line or remove this line. Place comments above this line.--> | }}<!--Please do not write below this line or remove this line. Place comments above this line.--> | ||
Revision as of 03:59, 22 May 2016
| DYK toolbox |
|---|
Binary search algorithm
- ... that when Jon Bentley assigned the binary search algorithm in a course for professional programmers, 90 percent of the programmers failed to provide a correct solution?
- ALT1:... that from 1946 to 1960, every published implementation of the binary search algorithm worked only for some inputs?
- ALT2:... that from 1946 to 1960, every published implementation of the binary search algorithm worked only for some arrays?
- ALT3:... that when the binary search algorithm was assigned in a course for professional programmers, 90 percent of the programmers failed to provide a correct solution?
- Comment: I have less than five DYK nominations, so I do need to review another nomination (although I might).
Improved to Good Article status by Esquivalience (talk). Self-nominated at 23:23, 11 May 2016 (UTC).