Re: Algorithm Optimization

"A. K." <minforth@arcor.de>
Mon, 21 Sep 2020 02:12:37 -0700 (PDT)

          From comp.compilers
Related articles
[6 earlier articles]
Re: Algorithm Optimization rick.c.hodgin@gmail.com (Rick C. Hodgin) (2020-09-16)
Re: Algorithm Optimization derek@_NOSPAM_knosof.co.uk (Derek M. Jones) (2020-09-16)
Re: Algorithm Optimization gah4@u.washington.edu (gah4) (2020-09-16)
Re: Algorithm Optimization richard.nospam@gmail.com (Richard Harnden) (2020-09-16)
Re: Algorithm Optimization DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-09-17)
Re: Algorithm Optimization tkoenig@netcologne.de (Thomas Koenig) (2020-09-17)
Re: Algorithm Optimization minforth@arcor.de (A. K.) (2020-09-21)
Re: Algorithm Optimization DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-12-13)
Re: Algorithm Optimization gah4@u.washington.edu (gah4) (2020-12-20)
Re: Algorithm Optimization johann@myrkraverk.com (Johann 'Myrkraverk' Oskarsson) (2021-04-21)
| List of all articles for this month |
From: "A. K." <minforth@arcor.de>
Newsgroups: comp.compilers
Date: Mon, 21 Sep 2020 02:12:37 -0700 (PDT)
Organization: Compilers Central
References: 20-09-032 20-09-035 20-09-036 20-09-042
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="17997"; mail-complaints-to="abuse@iecc.com"
Keywords: optimize
Posted-Date: 21 Sep 2020 21:33:06 EDT
In-Reply-To: 20-09-042

Am Sonntag, 20. September 2020 03:06:00 UTC+2 schrieb Hans-Peter Diettrich:
> Am 16.09.2020 um 07:25 schrieb gah4:
>
> > One thought was that someone codes bubblesort, and the compiler
> > generates quicksort. Small complication that bubblesort is stable, and
> > quicksort isn't. (Add an array with the original position to break ties.)
>
> Right, algorithm or control flow optimization should be located in an
> earlier project stage, not in compilation. It also smells like the dream
> of automated "proof of correctness", whose basics I learned 50 years ago
> but never found usable results yet. How shall a tool suggest other
> algorithm(s) without knowing (having determined - how?!) about the goals
> of a piece of code?


On a much higher level, (semi)automatic algorithm selection can increase
application productivity enormously.


F.ex. look at the Wolfram language
https://www.wolfram.com/language/principles/

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.