| Re: traverse linked list (Fortran 90) |
|
 |
|
 |
|
 |
|
 |
Group: comp.lang.fortran · Group Profile
Author: e p chandlere p chandler Date: Sep 19, 2008 05:16
On Sep 19, 12:20Â am, Ron Ford wrote:
> On Tue, 16 Sep 2008 11:30:59 -0700 (PDT), e p chandler posted:
>
>> I acutally understand what this code does! The only subtle part is
>
>> t%%p => c
>
>> --- If the list is NOT empty, add the newly created node onto the
>> chain.
>
> What data did you use to test?
The read loop exits when a 0 is entered, so I tried lists with 0
through 5 members. For lists of length N, for N = 2 to 3, I tried all
permutations of the integers from 1 to N.
[Proof that all odd numbers are prime - 3 is prime, 5 is prime, 7 is
prime ..... :-)]
- e
| 
