I am of the opinion that python JIT efficiency has not just catched up with C++ and rust. Probably faster, but that is not the whole story when it comes to comparing these languages, it is the problem being solved that decides the performance.
Recursive Fibonacci (fib(47)) is a classic pathological case:
- It has exponential time complexity O(2ⁿ) with naive recursion.
- It stresses function call overhead, stack management, and lack of tail-call optimization—not computational throughput, memory efficiency, or systems-level performance.
I am of the opinion that python JIT efficiency has not just catched up with C++ and rust. Probably faster, but that is not the whole story when it comes to comparing these languages, it is the problem being solved that decides the performance.
Recursive Fibonacci (fib(47)) is a classic pathological case: