Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However inserting ...

Optimizations in programming have mostly been associated with more efficient data structures or algorithms. Any optimization that uses hardware resources explicitly is generally considered premature, ...