|Code Listing by Teodor Kichatov|
fork of http://code.activestate.com/recipes/269554-select-the-nth-smallest-element/
O(n) quicksort style algorithm for looking up data based on rank order. Useful for finding medians, percentiles, quartiles, and deciles. Equivalent to [data[n] for n in positions] when the data is already sorted.
Search nth smallest float in really big file (more, more and more bigger than available RAM)
in a single pass through the file
if your file more than 150GB - you should use a more appropriate sampling params to the data
All files and free downloads are copyright of their respective owners. We do not provide any hacked, cracked, illegal, pirated version of scripts, codes, components downloads. All files are downloaded from the publishers website, our file servers or download mirrors. Always Virus check files downloaded from the web specially zip, rar, exe, trial, full versions etc. Download links from rapidshare, depositfiles, megaupload etc not published.