Path: csiph.com!xmission!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: gah4 Newsgroups: comp.compilers Subject: Re: Algorithm Optimization Date: Sun, 20 Dec 2020 22:45:16 -0800 (PST) Organization: Compilers Central Lines: 25 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <20-12-005@comp.compilers> References: <20-09-032@comp.compilers> <20-12-004@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="71334"; mail-complaints-to="abuse@iecc.com" Keywords: optimize, design Posted-Date: 21 Dec 2020 11:30:45 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-12-004@comp.compilers> Xref: csiph.com comp.compilers:2622 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 underlying algorithm. But the urge to reinvent solutions to already solved problems is sometimes too great.