LazySorted: A lazily,partially sorted Python list

Lazysorted is a python c extension implementing a partially and lazily sorted list data structure. it solves a common problem faced by programmers,in which they need just part of a sorted list,like its middle element (the median),but sort the entire list to get it. lazysorted presents them with the abstraction that they are working with a fully sorted list,while actually only sorting the list partially with quicksort partitions to return the requested sub-elements. this enables programmers to use naive “sort rst” algorithms but nonetheless attain linear run-times when possible. lazysorted may serve as a drop-in replacement for the built-in sorted function in most cases,and can sometimes achieve run-times more than 7 times faster. © 2015,american statistical association. all rights reserved.