its dictionary means shorted ordered arry. let low = 1; and high= const.(10^const)
Boolean isWord(String word) { while(low <= high) { mid = (low+ high)/2; if(word = getWordAt(mid)) return true; if( word > getWordAt(mid)) { high = mid-1 } else low = mid+1; } } Its a simple Binary Search Algorithm ... who's complexity is O(log n) times. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.