Timeline for Efficient Binary Search
Current License: CC BY-SA 3.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 29, 2016 at 4:09 | history | protected | Jamal | ||
| Feb 13, 2014 at 13:39 | answer | added | Jobob Smiff | timeline score: 6 | |
| Dec 3, 2013 at 15:48 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 10 characters in body; edited tags
|
| Dec 3, 2013 at 14:06 | answer | added | VLAD | timeline score: 0 | |
| Jan 28, 2013 at 14:41 | answer | added | Bill Woodger | timeline score: 2 | |
| Oct 19, 2012 at 23:25 | comment | added | user18524 | I believe what you're doing is called an interpolation search. en.wikipedia.org/wiki/Interpolation_search | |
| Feb 8, 2012 at 12:11 | comment | added | Sandro Pasquali | That's always the question, isn't it... Nevertheless, perhaps the goal for a binary search is always maximum speed? | |
| Feb 5, 2012 at 18:08 | comment | added | sepp2k | Maybe so, but the (very) minor performance gain you may get from this almost certainly isn't worth the reduced readability. | |
| Feb 5, 2012 at 17:25 | comment | added | Sandro Pasquali | You'll get a performance boost by changing: Math.floor((low + high) / 2) to: (low + high) >> 1 | |
| Oct 14, 2011 at 23:44 | answer | added | user7649 | timeline score: 16 | |
| Oct 14, 2011 at 22:03 | history | tweeted | twitter.com/#!/StackCodeReview/status/124968630369783808 | ||
| Oct 14, 2011 at 21:49 | comment | added | Winston Ewert | I'm sorry, but information theory dooms your attempt. The only way to speed up the binary search is by making assumptions about the kind of data you are storing. | |
| Oct 14, 2011 at 21:20 | answer | added | Mark Ransom | timeline score: 1 | |
| Oct 14, 2011 at 19:46 | history | edited | Oliver Morgan | CC BY-SA 3.0 |
added 671 characters in body
|
| Oct 14, 2011 at 18:59 | answer | added | Guffa | timeline score: 5 | |
| Oct 14, 2011 at 18:52 | answer | added | Peter Taylor | timeline score: 0 | |
| Oct 14, 2011 at 18:05 | history | asked | Oliver Morgan | CC BY-SA 3.0 |