Wed, 27 Jan 1993 09:20:19 GMT

Related articles |
---|

Wanted: folk theorems in Fortran Programming. steve@hubcap.clemson.edu (1993-01-26) |

Re: Wanted: folk theorems in Fortran Programming. dodd@mycenae.cchem.berkeley.edu (1993-01-27) |

Re: Wanted: folk theorems in Fortran Programming. apofort!metcalf@dxmint.cern.ch (1993-01-28) |

Re: Wanted: folk theorems in Fortran Programming. davidm@questor.rational.com (1993-01-28) |

Re: Wanted: folk theorems in Fortran Programming. davidm@questor.rational.com (1993-01-28) |

Re: Wanted: folk theorems in Fortran Programming. steve@hubcap.clemson.edu (1993-01-29) |

Re: Wanted: folk theorems in Fortran Programming. wand@dec5120z.ccs.northeastern.edu (1993-01-29) |

Newsgroups: | comp.compilers,comp.lang.fortran |

From: | dodd@mycenae.cchem.berkeley.edu (Lawrence R. Dodd) |

Organization: | Dept of Chemical Engineering, Polytechnic Univ, NY, USA |

Date: | Wed, 27 Jan 1993 09:20:19 GMT |

References: | 93-01-193 |

Keywords: | Fortran |

"Steve" Stevenson <steve@hubcap.clemson.edu> writes:

*> I am trying to make a catalog of folk wisdom in fortran programming.*

My personal favorite is the one discussed on page 137 of the 1st edition of

Numerical Recipes (Fortran edition, of course):

BAD

P = c(1) + c(2)*x + c(3)*x**2 + c(4)*x**3 + c(5)*x**4

GOOD

P = c(1) + x*(c(2) + x*(c(3) + x*(c(4) + x*c(5))))

It is a little harder to read but you won't be `summarily executed'

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.