title: Does python use the best possible algorithms in order to save the most time it can?
body: <p>I have a question that might be very simple to answer. 
  I couldn't find the answer anywhere.
  Does python use the best possible algorithms in order to save the most time it can?
  I just saw on some website that for example, the <strong>max</strong> method time order -in lists- is O(n) in python which there are better time orders as you know.
  Is it true?
  should I use the algorithms that I know they can perform better in order to save more time or does python did this for me in its methods?</p>