Interesting idea, I think in this case the table lookup would be the preferable way to go (no real memory constraints and constant time, but I think I’ll keep a binary tree comparison in mind for possible future use. Always more than one way to skin a cat… Thanks again.
Martin Jay McKee