|[8 earlier articles]|
|Re: Algorithm Optimization email@example.com (gah4) (2020-09-16)|
|Re: Algorithm Optimization firstname.lastname@example.org (Richard Harnden) (2020-09-16)|
|Re: Algorithm Optimization DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-09-17)|
|Re: Algorithm Optimization email@example.com (Thomas Koenig) (2020-09-17)|
|Re: Algorithm Optimization firstname.lastname@example.org (A. K.) (2020-09-21)|
|Re: Algorithm Optimization DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-12-13)|
|Re: Algorithm Optimization email@example.com (gah4) (2020-12-20)|
|Date:||Sun, 20 Dec 2020 22:45:16 -0800 (PST)|
|Injection-Info:||gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="71334"; mail-complaints-to="firstname.lastname@example.org"|
|Posted-Date:||21 Dec 2020 11:30:45 EST|
On Sunday, December 13, 2020 at 3:16:03 PM UTC-8, Hans-Peter Diettrich wrote:
(snip on algorithmic optimization)
> > [I think the usual way to do this is to provide a way to express higher level
> > algorithms in your programming language so the compiler doesn't have to try
> > to reverse engineer them. -John]
> What's the best language to express algorithms in?
> Or, how many languages claim that already...
C has qsort(). While the name seems to suggest quicksort, that isn't
a requirement of the implementation. It does suggest an algorithm
independent way to write programs that need sorting.
Java has classes like List, and subclasses like ArrayList and LinkedList.
One can write a program using List, and easily switch later between
ArrayList, LinkedList, or any other implementation of List.
Hopefully, in addition to the specific cases supplied, these suggest
ways to implement new problems independent of the specific
But the urge to reinvent solutions to already solved problems is
sometimes too great.
Return to the
Search the comp.compilers archives again.