Path: csiph.com!goblin2!goblin3!goblin.stu.neva.ru!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: "A. K." Newsgroups: comp.compilers Subject: Re: Algorithm Optimization Date: Mon, 21 Sep 2020 02:12:37 -0700 (PDT) Organization: Compilers Central Lines: 19 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <20-09-044@comp.compilers> References: <20-09-032@comp.compilers> <20-09-035@comp.compilers> <20-09-036@comp.compilers> <20-09-042@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" 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 X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com In-Reply-To: <20-09-042@comp.compilers> Xref: csiph.com comp.compilers:2615 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/