* Algorithms
@ 1997-03-12 0:00 Tyler Nelson (TJ)
1997-03-13 0:00 ` Algorithms Tom Moran
` (2 more replies)
0 siblings, 3 replies; 6+ messages in thread
From: Tyler Nelson (TJ) @ 1997-03-12 0:00 UTC (permalink / raw)
I found this newsgroup on the web and was wondering if anyone out there
knew of a place to get information on different algorithms used in Ada
for different situations. I am fairly new to the language, but I know
how the syntax works. I just am having problems figuring out which
algorithms to use. Any help would be desperately appreciated.
TJ Nelson (Perrin@cs.montana.edu)
^ permalink raw reply [flat|nested] 6+ messages in thread
* Re: Algorithms
1997-03-12 0:00 Algorithms Tyler Nelson (TJ)
1997-03-13 0:00 ` Algorithms Tom Moran
1997-03-13 0:00 ` Algorithms Michael F Brenner
@ 1997-03-13 0:00 ` Robert Dewar
2 siblings, 0 replies; 6+ messages in thread
From: Robert Dewar @ 1997-03-13 0:00 UTC (permalink / raw)
<<I found this newsgroup on the web and was wondering if anyone out there
knew of a place to get information on different algorithms used in Ada
for different situations. I am fairly new to the language, but I know
how the syntax works. I just am having problems figuring out which
algorithms to use. Any help would be desperately appreciated.>>
This is a little confused. The algorithms used in programs are pretty much
independent of the language in which the program is used, and any good
book on algorithms will describe sets of interesting algorithgms in a
pretty much language independent manner.
Perhaps what you are looking for is examples of Ada code, and for that
you should go to www.adahome.com, which has lots of good pointers to
this, and much other useful stuff.
^ permalink raw reply [flat|nested] 6+ messages in thread
* Re: Algorithms
1997-03-12 0:00 Algorithms Tyler Nelson (TJ)
1997-03-13 0:00 ` Algorithms Tom Moran
@ 1997-03-13 0:00 ` Michael F Brenner
1997-03-13 0:00 ` Algorithms Bob Klungle
1997-03-13 0:00 ` Algorithms Robert Dewar
2 siblings, 1 reply; 6+ messages in thread
From: Michael F Brenner @ 1997-03-13 0:00 UTC (permalink / raw)
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.
^ permalink raw reply [flat|nested] 6+ messages in thread
* Re: Algorithms
1997-03-12 0:00 Algorithms Tyler Nelson (TJ)
@ 1997-03-13 0:00 ` Tom Moran
1997-03-14 0:00 ` Algorithms Jerry Petrey
1997-03-13 0:00 ` Algorithms Michael F Brenner
1997-03-13 0:00 ` Algorithms Robert Dewar
2 siblings, 1 reply; 6+ messages in thread
From: Tom Moran @ 1997-03-13 0:00 UTC (permalink / raw)
There's always the old standy of the Knuth books. Or something
(slightly) newer like "The Design and Analysis of Computer Algorithms"
by Aho, Hopcroft, and Ullman. What kinds of algorithms do you need?
^ permalink raw reply [flat|nested] 6+ messages in thread
* Re: Algorithms
1997-03-13 0:00 ` Algorithms Michael F Brenner
@ 1997-03-13 0:00 ` Bob Klungle
0 siblings, 0 replies; 6+ messages in thread
From: Bob Klungle @ 1997-03-13 0:00 UTC (permalink / raw)
Eloquently stated.
Michael F Brenner <mfb@mbunix.mitre.org> wrote in article
<5g9alh$6r9@top.mitre.org>...
> 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.
>
>
^ permalink raw reply [flat|nested] 6+ messages in thread
* Re: Algorithms
1997-03-13 0:00 ` Algorithms Tom Moran
@ 1997-03-14 0:00 ` Jerry Petrey
0 siblings, 0 replies; 6+ messages in thread
From: Jerry Petrey @ 1997-03-14 0:00 UTC (permalink / raw)
Tom Moran wrote:
>
> There's always the old standy of the Knuth books. Or something
> (slightly) newer like "The Design and Analysis of Computer Algorithms"
> by Aho, Hopcroft, and Ullman. What kinds of algorithms do you need?
FYI, the first volume of the revised Knuth editions is due out in
about a month with the rest to follow over the next few months.
Thanks Addison Wesley!
--
=====================================================================
== Jerry Petrey ==
== Consultant Software Engineer - Member Team Ada and Team Forth ==
== Rockwell Collins Commercial Avionics Group ==
== Melbourne, FL email: gdp@mlb.cca.rockwell.com ==
=====================================================================
^ permalink raw reply [flat|nested] 6+ messages in thread
end of thread, other threads:[~1997-03-14 0:00 UTC | newest]
Thread overview: 6+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1997-03-12 0:00 Algorithms Tyler Nelson (TJ)
1997-03-13 0:00 ` Algorithms Tom Moran
1997-03-14 0:00 ` Algorithms Jerry Petrey
1997-03-13 0:00 ` Algorithms Michael F Brenner
1997-03-13 0:00 ` Algorithms Bob Klungle
1997-03-13 0:00 ` Algorithms Robert Dewar
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox