highest is a program that efficiently finds the n highest (or lowest) numbers in a list of numbers on stdin. The traditional way of computing this using GNU sort should have a running time of O(n log n), where n is the number of numbers to check. Highest should have a running time of O(n log m), where m is the number of numbers you want to keep. A graph comparing the performance of highest to that of GNU sort is provided.
|Tags||System Administration shell scripting|
|Licenses||UCI License (BSD-like)|
|Operating Systems||OS Independent|
Release Notes: Additional performance gains have been achieved using a heap or treap, depending on command line options and available Python modules. The heap version performs well and uses modules that come with Python. The treap version performs even better, but requires an extra module.
No changes have been submitted for this release.