Develop and Download Open Source Software

highest

We call for your help with the Japanese translations for project summaries. The submitted translations will be posted after simple evaluation. (Not only the translation itself is going to be checked, but we also make sure it's clear of wiki format problems. Especially problems that are related to the layout, such as line breaks and links, will be checked, so please give heed. When there appears to be a problem with the translation itself or the layout, we may not be able to post your translation. We often see problematic cases related to links. When there's going to be a line of Japanese text right after the URL, please make sure to leave a space to separate.) Also, even with projects that may already have their summaries translated, if you find an outdated translation or typographical errors, please update. Login to start translating. When you are done, you will find your name at the bottom of the summary as the translator.

You are not Logged in. If you submit this translation, your name will not show on the this project page (will be logged as "translated by an anonymous user").

Project Description:

English:
(Last Update 2009-06-12 19:07)

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.

No Japanese Translated Data
Japanese: