|[7 earlier articles]|
|Re: Algorithm Optimization derek@_NOSPAM_knosof.co.uk (Derek M. Jones) (2020-09-16)|
|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)|
|From:||Hans-Peter Diettrich <DrDiettrich1@netscape.net>|
|Date:||Sun, 13 Dec 2020 23:13:07 +0100|
|Injection-Info:||gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="57338"; mail-complaints-to="firstname.lastname@example.org"|
|Posted-Date:||13 Dec 2020 18:16:00 EST|
On 13.09.20 19:00, Rick C. Hodgin wrote:
> I've been pursuing the idea of what I call algorithm optimization. It's
> the idea that algorithms coded by individuals may not be optimal, and
> may require refactoring / re-engineering to be made optimal based on
> what's trying to be achieved.
> In the above example, a linked list structure is allocated and some data
> is stored into it. In this example a single x variable, but in a
> real-world case there may be many variables.
A linked list may be the best solution by itself, but not in some
algorithm. How shall a compiler find out that a linked list here is the
best solution, due to some list features used somewhere else?
> [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...
Return to the
Search the comp.compilers archives again.