From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=0.1 required=5.0 tests=BAYES_05,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,7bba3224cf6d1d9c
X-Google-Attributes: gid103376,public
From: mfb@mbunix.mitre.org (Michael F Brenner)
Subject: Re: Algorithms
Date: 1997/03/13
Message-ID: <5g9alh$6r9@top.mitre.org>#1/1
X-Deja-AN: 225224524
References: <332785AB.41C6@cs.montana.edu>
Organization: The MITRE Corporation, Bedford Mass.
Newsgroups: comp.lang.ada
Date: 1997-03-13T00:00:00+00:00
List-Id: <comp.lang.ada>


To become familiar with which algorithm to use it is easiest if you 
develop your skills in three simultaneous areas: (a) theory of algorithms
by reading books about algorithms and I recommend starting with Word
Processing in Groups by Epstein, (b) theory of how to program correctly
and I recommend starting with Discipline of Programming by Dijkstra,
and (c) practical implementation of hundreds of algorithms and I recommend
starting by downloading a thousand random Ada files from the PAL and
analyzing how complex they are and EXACTLY how their preconditions
guarantee they meet their postconditions. Then you will be worthy to
create one of those beautiful algorithms for which the Ada language was
created: an algorithm that works.