On Thu, Sep 24, 2015 at 12:57 PM, Christophe Bal <projet...@gmail.com> wrote:
> By pseudo example, I mean pseudo code. > 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. As others have said, goto is also useful for languages without exception handling, C for instance. You will find gotos in the Linux kernel and in the Numpy core used for that purpose. However, the post was for laughs, I didn't expect serious discussion. The current thread is a pleasant surprise. Chuck
_______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org https://mail.scipy.org/mailman/listinfo/numpy-discussion
