Absolutely not. Even if you write an interpreter in Python, a hashtable lookup (O(1)) leading to an O(n) algorithm will be faster in this interpreted language than a O(n^2) algorithm using the O(n) list lookup in C; for a sufficiently high <i>n</i>, of course, but it&#x27;s not uncommon to have <i>n</i> of several million these days.