TEAM-ADA Archives

Team Ada: Ada Programming Language Advocacy

TEAM-ADA@LISTSERV.ACM.ORG

Options: Use Forum View

Use Proportional 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:
Terry Westley <[log in to unmask]>
Reply To:
Terry Westley <[log in to unmask]>
Date:
Fri, 29 Sep 2000 09:09:22 -0400
Content-Type:
text/plain
Parts/Attachments:
text/plain (13 lines)
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