Path: utzoo!utgpu!watserv1!watmath!att!att!pacbell.com!ucsd!sdd.hp.com!hplabs!hpcc05!hpcuhb!hpcllla!hpcllmv!jbc
From: jbc@hpcllmv.HP.COM (Jeff Caldwell)
Newsgroups: comp.lang.fortran
Subject: Re: Fortran -vs- C (yet again)
Message-ID: <1270010@hpcllmv.HP.COM>
Date: 28 Nov 90 04:46:04 GMT
References: <1990Nov24.002836.19739@ariel.unm.edu>
Organization: Hewlett Packard Calif. Language Lab
Lines: 18


>     Different languages are suited for different problems.
>
>     First you get an algorithm, then a data structure, and
>   THEN you decide on the language. Otherwise you're operating
>   with tunnel vision before you start to code.
>
>     Of course, you can always do one-shot stuff in APL ! b-)
>
>    Iain

I can see determining an algorithm first, but a data structure?  I'd
hate to implement a binary tree or sparse matrix in a language without
pointers:-)  The binary tree is possible with an array but that causes
predefined limits on the size.  Use of records/structures could pose a
problem too.

			-Jeff Caldwell