Timeline for Generic binary search
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 6, 2011 at 12:14 | comment | added | Lukasz Madon | rescheduled :P ... | |
| Dec 6, 2011 at 11:46 | comment | added | Mike Nakis | So, how did your interview go, @lukas? | |
| Nov 28, 2011 at 12:40 | answer | added | Mike Nakis | timeline score: 1 | |
| Nov 28, 2011 at 12:14 | comment | added | Lukasz Madon | prepering for an interview | |
| Nov 28, 2011 at 10:26 | comment | added | Mike Nakis | In C# both the System.Generic.List class and the System.Array class already have generic BinarySearch() methods which work with Comparer delegates, or with objects implementing IComparable. They are known to work very well, and they perform actual search, meaning that they return the index of the item found, (or, if not found, the negated index at which it should be inserted,) instead of what your methods do, which is to simply answer the question of whether an item exists in an array. So, why are you trying to re-invent this wheel? | |
| Nov 28, 2011 at 8:05 | answer | added | Mike Nakis | timeline score: 0 | |
| Nov 27, 2011 at 22:34 | history | asked | Lukasz Madon | CC BY-SA 3.0 |