Hi guys,
I'm asking this question purely for interest as I saw this question a while ago and started thinking about it.
If you have a sorted array, how would you write a Find() method that is efficient in processor usage that finds an integer in that array.
Any takers?
Transcend
![[gorgeous] [gorgeous] [gorgeous]](/data/assets/smilies/gorgeous.gif)
I'm asking this question purely for interest as I saw this question a while ago and started thinking about it.
If you have a sorted array, how would you write a Find() method that is efficient in processor usage that finds an integer in that array.
Any takers?
Transcend
![[gorgeous] [gorgeous] [gorgeous]](/data/assets/smilies/gorgeous.gif)