TEAM-ADA Archives

Team Ada: Ada Programming Language Advocacy

TEAM-ADA@LISTSERV.ACM.ORG
Options: Use Classic View

Use Monospaced Font
Show Text Part by Default
Condense Mail Headers

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

Print Reply
Sender: "Team Ada: Ada Advocacy Issues (83 & 95)" <[log in to unmask]>
X-To: Terry Westley <[log in to unmask]>
Date: Fri, 29 Sep 2000 11:41:36 -0400
Reply-To: Steven Deller <[log in to unmask]>
Subject: Re: Sorting Algorithms
From: Steven Deller <[log in to unmask]>
Content-Transfer-Encoding: 7bit
In-Reply-To: <[log in to unmask]>
Content-Type: text/plain; charset="iso-8859-1"
MIME-Version: 1.0
Parts/Attachments: text/plain (29 lines) 
Terry,
I have an Ada heapsort that improves on the Knuth algorithm (minor
improvement to cut startup loops in half) and is written, I believe, to be
very clearly readable.  Would you care to swap sources?

Regards,
Steve

> -----Original Message-----
> From: Team Ada: Ada Advocacy Issues (83 & 95)
> [mailto:[log in to unmask]]On Behalf Of Terry Westley
> Sent: Friday, September 29, 2000 9:09 AM
> To: [log in to unmask]
> Subject: Re: Sorting Algorithms
>
>
> Of course, if analysis of algorithms is your goal, you should be
> able to use a C/C++ book.  Though not Ada, my favorite is still my
> university text: Wirth's "Algorithms + Data Structures = Programs."
> I find Pascal easier to read than MIX.
>
> Just a week ago, I implemented heap sort with guidance from Wirth.
>
> --
> Terry J. Westley, Software Development Manager
> Veridian Engineering, Information Warfare
> P.O. Box 400, Buffalo, NY 14225
> [log in to unmask]    http://www.veridian.com

ATOM RSS1 RSS2