Path: csiph.com!xmission!news.snarked.org!border2.nntp.dca1.giganews.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Hans-Peter Diettrich Newsgroups: comp.compilers Subject: Re: Algorithm Optimization Date: Sun, 13 Dec 2020 23:13:07 +0100 Organization: Compilers Central Lines: 27 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <20-12-004@comp.compilers> References: <20-09-032@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="57338"; mail-complaints-to="abuse@iecc.com" Keywords: optimize Posted-Date: 13 Dec 2020 18:16:00 EST 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-032@comp.compilers> Content-Language: en-US Xref: csiph.com comp.compilers:2621 On 13.09.20 19:00, Rick C. Hodgin wrote: > 1. > > 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] +1 What's the best language to express algorithms in? Or, how many languages claim that already... DoDi