If an algorithm does more computations compared to another, is it faster? Or is it slower as it has to do more computations? Is there a difference between computation and operation?
In Q1 : L does 500 operations and is thus deemed slower.
In Q2 : L does 20000 computations while Q does 4200 but L is called faster.
In Q3 : Q does more computations (~10^5) but is called slower.
I believe there's an error. Am I missing something?