Thread: [Help]C++
View Single Post
Old 12-25-2010   #18
Adam
Registered Member
 
Adam's Avatar
 
Last Online: 06-03-2013
Join Date: Feb 2008
Posts: 1,410
Thanks: 1,444
Thanked 1,235 Times in 689 Posts
Groans: 25
Groaned at 21 Times in 19 Posts
Default

Does anyone know if there is any advantage in performance when using recursive binary search rather than normal binary search?


EDIT: I also find this piece of code when reading about recursive binary search...
Code:
int nMid = (nMin + nMax) >> 1;
Does anyone knows what it means?

Last edited by Adam; 12-25-2010 at 05:59 PM.
Adam is offline   Reply With Quote