Jesse Farmer <[log in to unmask]> writes:
> Hi everyone.
> Maybe I just haven't looked hard enough, but in the few hours that I
> searched, I've been unable to find a good package of sorting
> routines. Does anyone know of such a package?
You can use my sorted binary trees package to do this. Not guarranteed
to be the most time or space efficient, but it works.
Let me know if the comments need improving :).
There is also a heap sort in the GNAT runtime library; see
www.adapower.com has several packages of Ada code; some may have
sorting routines (searching is not extremely efficient there, so I
can't be sure).