The complexity of member looking up: Python Vs. Javascript
<p>I am curious about the complexity of Python and JS 's looking up: </p>

<p>Python supports multi-inheritance, which affects the member lookup. Specifically, when referencing a member from an instance of a class, the process will start from the instance's dict, then to the class of the instance, then up to the super classes of the class of the instance, which for each super class, it has its own super class list..... which seems to end up with the complexity to be exponential (theoretically). </p>

<p>While it seems that the JS's member lookup time is linear -- which just has to trace back to the prototype chain.</p>

<p>Am I reasoning the right way? or I am missing something?</p>
