i th order statistic in Python
<p>Given a list of <code>n</code> comparable elements (say numbers or string), the optimal algorithm to find the <code>i</code>th ordered element takes <code>O(n)</code> time.</p>

<p>Does Python implement natively <code>O(n)</code> time order statistics for lists, dicts, sets, ...?</p>
