Does anyone know how the compareTo() in TreeSet is implemented?
I needed a sorted list of String elements and was going to use a binary chop method to find if a search key was in the list. Is this how the TreeSet does it already? Reason I'm asking is because speed is very important in this case.