> time complexity and performance are the same thing
By definition, they are not.
> Mathematically the log n is always faster :)
No, it's not. Time complexity only gives you an asymptotic bound on the number of 'operations', it tells you nothing about what the actual run time will be.
By definition, they are not.
> Mathematically the log n is always faster :)
No, it's not. Time complexity only gives you an asymptotic bound on the number of 'operations', it tells you nothing about what the actual run time will be.