home *** CD-ROM | disk | FTP | other *** search
- nsort is a totally stripped down sort(1); it reads a file into memory,
- sorts it using merge sort, and writes the result out. I wrote it to
- show that merge sort is fast -- sort(1) is documented as using a
- version of quicksort internally, and nsort beats it easily even when
- sort(1) is given enough memory to sort in memory.
- To compile it, just run make(1).
-