The Question:

If you had a binary search function in three substantially different (such as C++, Java, and Python) programming languages. In each program, if you did 8,000,000 unsuccessful searches for eight different-sized arrays, are there differences between the three programs and how they compare to the theoretical timings of the binary search algorithm? Explain your timings and observations.

What I want:

I don't care about the code for each specific function, that's a google search away, but can someone explain how and WHY the timings would be different in 3 different programming languages (of whoever will answer this question's choice)? Thank you!