From: "M. Edward (Ed) Borasky" <znmeb@...>
Date: 2007-11-12T11:57:47+09:00
Subject: Re: comp.lang.fortran challenge

Bil Kleb wrote:
[snip]

Yeah ... it wasn't clear to me than anyone had set what the limits were. 
If the code only has to deal with little chunks of data like

====================
time: 00 minutes
====================
velocity U in m/s

U ( 1, 1, 1) = 12.34
U ( 1, 1, 2) = 10.00
U ( 1, 1, 3) = 11.01
U ( 1, 2, 1) = 10.05
U ( 1, 2, 2) = 12.40
U ( 1, 2, 3) = 11.20
U ( 1, 3, 1) = 12.80
U ( 1, 3, 2) = 10.30
U ( 1, 3, 3) = 11.25

velocity V in m/s

V ( 1, 1, 1) = 11.40
V ( 1, 1, 2) = 12.00
V ( 1, 1, 3) = 13.50
V ( 1, 2, 1) = 11.00
V ( 1, 2, 2) = 11.70
V ( 1, 2, 3) = 11.25
V ( 1, 3, 1) = 11.50
V ( 1, 3, 2) = 10.60
V ( 1, 3, 3) = 11.23

"little" being defined as nine U values and nine V values per time step, 
I don't see why one would do this in awk or Ruby when Fortran could do 
it. It's been about 18 years since I read or wrote any Fortran, but I 
didn't know awk at the time and so, presented with a problem like this, 
would have coded it in Fortran. I think the real challenge here in any 
language is to scale this up to way more than nine U and V values per 
time step -- something where you'd actually need some kind of efficient 
data structure. :)