TEAM-ADA Archives

Team Ada: Ada Programming Language Advocacy

TEAM-ADA@LISTSERV.ACM.ORG

Options: Use Forum View

Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Subject:
From:
Stephen Leake <[log in to unmask]>
Reply To:
Stephen Leake <[log in to unmask]>
Date:
Mon, 18 Dec 2000 11:02:55 -0500
Content-Type:
text/plain
Parts/Attachments:
text/plain (25 lines)
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.

http://users.erols.com/leakstan/Stephe/Ada/sal.html

Let me know if the comments need improving :).

There is also a heap sort in the GNAT runtime library; see
GNAT.Heap_Sort_A.

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).

--
-- Stephe

ATOM RSS1 RSS2