title: Efficiently get kth smallest element in unsorted list in python
body: <p>Is there any fast/efficient method available for solving this problem?</p>
  
  <p>I can do it in <code>O(nlogn)</code> but faster solution I am expecting.</p>