Very funny ! š Le 25 sept. 2015 07:53, "Alexander EberspƤcher" <alex.eberspaec...@gmail.com> a Ć©crit :
> On 24.09.2015 21:12, Charles R Harris wrote: > > > I find Cleve Moler's old Fortran version of Brent's zero finding > > algorithm using gotos clearer than the structured versions you can find > > in Numerical Recipes. The operation of the algorithm is easiest to > > describe as a finite state machine. > > I need to look into that piece of Fortran code. I've never (knowingly) > implemented a state-machine myself. However I can say that specifically > Fortran has named loops, which probably helps to avoid many uses of goto. > > > However, the post was for laughs, I didn't expect serious discussion. > > Well, then let me fill in the missing piece - the obligatory XKCD strip: > > https://www.xkcd.com/292/ > > Alex > > > > > > > _______________________________________________ > NumPy-Discussion mailing list > NumPy-Discussion@scipy.org > https://mail.scipy.org/mailman/listinfo/numpy-discussion > >
_______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org https://mail.scipy.org/mailman/listinfo/numpy-discussion
