The most guesses that should be necessary when finding one element in a set of a hundred using a binary search should be seven. I would be surprised if a properly implemented binary search could be considered slow with such a small data set. How are you timing it?