Jimbo

iteration > recursion usually...

I don't see how a binary tree is better than a linear comparison for checking if two strings are equal. I understand if you're searching through sorted data, but binary tree or linear comparison, you still have to compare the whole of each string

DaWei

First, if you're taking about a C-string, checking the length would be a big waste. You could do the comparison and be done by the time you counted the characters. Unless you have some very specialized knowledge about some very specially-arranged strings, binary hopping-about is only going to slow you down with the attendant overhead while providing no benefits. Your method might make a great learning exercise, but don't try to sell it to a knowledgeable boss. If your teacher mentioned binary is better in THIS context, uh-oh.

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers