http://sna-projects.com/blog/2010/06/beating-binary-search/ Instead of just picking the middle, guess the position where the target value appears, and compares the value in the position with the target. This obtains O(loglogN).
* 현재 142,494명의 회원이 활동중이며, 최근 69명 (어제3명, 오늘5명)이 새롭게 참여하였습니다.
since 2008 © ITLAB · Powerd by ITLab Corp - www.itlab.co.kr