Just another update
This commit is contained in:
parent
a25938f123
commit
00a190b0a6
6591 changed files with 94363 additions and 23227 deletions
|
|
@ -1,12 +1,24 @@
|
|||
module fibonacci
|
||||
contains
|
||||
recursive function fibR(n) result(fib)
|
||||
integer, intent(in) :: n
|
||||
integer :: fib
|
||||
|
||||
select case (n)
|
||||
case (:0); fib = 0
|
||||
case (1); fib = 1
|
||||
case default; fib = fibR(n-1) + fibR(n-2)
|
||||
end select
|
||||
end function fibR
|
||||
FUNCTION IFIB(N)
|
||||
IF (N.EQ.0) THEN
|
||||
ITEMP0=0
|
||||
ELSE IF (N.EQ.1) THEN
|
||||
ITEMP0=1
|
||||
ELSE IF (N.GT.1) THEN
|
||||
ITEMP1=0
|
||||
ITEMP0=1
|
||||
DO 1 I=2,N
|
||||
ITEMP2=ITEMP1
|
||||
ITEMP1=ITEMP0
|
||||
ITEMP0=ITEMP1+ITEMP2
|
||||
1 CONTINUE
|
||||
ELSE
|
||||
ITEMP1=1
|
||||
ITEMP0=0
|
||||
DO 2 I=-1,N,-1
|
||||
ITEMP2=ITEMP1
|
||||
ITEMP1=ITEMP0
|
||||
ITEMP0=ITEMP2-ITEMP1
|
||||
2 CONTINUE
|
||||
END IF
|
||||
IFIB=ITEMP0
|
||||
END
|
||||
|
|
|
|||
|
|
@ -1,20 +1,11 @@
|
|||
function fibI(n)
|
||||
integer, intent(in) :: n
|
||||
integer, parameter :: fib0 = 0, fib1 = 1
|
||||
integer :: fibI, back1, back2, i
|
||||
|
||||
select case (n)
|
||||
case (:0); fibI = fib0
|
||||
case (1); fibI = fib1
|
||||
|
||||
case default
|
||||
fibI = fib1
|
||||
back1 = fib0
|
||||
do i = 2, n
|
||||
back2 = back1
|
||||
back1 = fibI
|
||||
fibI = back1 + back2
|
||||
end do
|
||||
end select
|
||||
end function fibI
|
||||
end module fibonacci
|
||||
EXTERNAL IFIB
|
||||
CHARACTER*10 LINE
|
||||
PARAMETER ( LINE = '----------' )
|
||||
WRITE(*,900) 'N', 'F[N]', 'F[-N]'
|
||||
WRITE(*,900) LINE, LINE, LINE
|
||||
DO 1 N = 0, 10
|
||||
WRITE(*,901) N, IFIB(N), IFIB(-N)
|
||||
1 CONTINUE
|
||||
900 FORMAT(3(X,A10))
|
||||
901 FORMAT(3(X,I10))
|
||||
END
|
||||
|
|
|
|||
|
|
@ -1,7 +1,12 @@
|
|||
program fibTest
|
||||
use fibonacci
|
||||
module fibonacci
|
||||
contains
|
||||
recursive function fibR(n) result(fib)
|
||||
integer, intent(in) :: n
|
||||
integer :: fib
|
||||
|
||||
do i = 0, 10
|
||||
print *, fibr(i), fibi(i)
|
||||
end do
|
||||
end program fibTest
|
||||
select case (n)
|
||||
case (:0); fib = 0
|
||||
case (1); fib = 1
|
||||
case default; fib = fibR(n-1) + fibR(n-2)
|
||||
end select
|
||||
end function fibR
|
||||
|
|
|
|||
20
Task/Fibonacci-sequence/Fortran/fibonacci-sequence-4.f
Normal file
20
Task/Fibonacci-sequence/Fortran/fibonacci-sequence-4.f
Normal file
|
|
@ -0,0 +1,20 @@
|
|||
function fibI(n)
|
||||
integer, intent(in) :: n
|
||||
integer, parameter :: fib0 = 0, fib1 = 1
|
||||
integer :: fibI, back1, back2, i
|
||||
|
||||
select case (n)
|
||||
case (:0); fibI = fib0
|
||||
case (1); fibI = fib1
|
||||
|
||||
case default
|
||||
fibI = fib1
|
||||
back1 = fib0
|
||||
do i = 2, n
|
||||
back2 = back1
|
||||
back1 = fibI
|
||||
fibI = back1 + back2
|
||||
end do
|
||||
end select
|
||||
end function fibI
|
||||
end module fibonacci
|
||||
7
Task/Fibonacci-sequence/Fortran/fibonacci-sequence-5.f
Normal file
7
Task/Fibonacci-sequence/Fortran/fibonacci-sequence-5.f
Normal file
|
|
@ -0,0 +1,7 @@
|
|||
program fibTest
|
||||
use fibonacci
|
||||
|
||||
do i = 0, 10
|
||||
print *, fibr(i), fibi(i)
|
||||
end do
|
||||
end program fibTest
|
||||
Loading…
Add table
Add a link
Reference in a new issue