Path: utzoo!attcan!uunet!pyrdc!pyrnj!rutgers!gatech!fabscal!dorn From: dorn@fabscal.UUCP (Alan Dorn Hetzel) Newsgroups: comp.lang.fortran Subject: Re: Fortran versus C for numerical anal Message-ID: <270@fabscal.UUCP> Date: 19 Sep 88 15:12:43 GMT References: <893@amelia.nas.nasa.gov> <50500072@uxe.cso.uiuc.edu> <1440@valhalla.ee.rochester.edu> <182@obie.UUCP> Reply-To: dorn@fabscal.UUCP (Alan Dorn Hetzel, Jr.) Organization: /usr/lib/news/organization Lines: 12 Both linked lists and sparse arrays are fairly trivial to implement in FORTRAN. Many implementations also support dynamic memory. Without the dynamic memory, one can allocate a working array and build structures within it. Pointers are array base relative, i.e. indexes, instead of absolute memory pointers. This also has the advantage of guaranteeing that the "pointer" is an integer. If the data types within the nodes are integer, one can store them within the same array, if not, one can allocate a second array of the appropriate type and point to them there with a node data pointer (whose base is the data array). Dorn gatech.edu!fabscal!dorn