Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Recursive fibonacci
!gfortran, gcc version 7.4.0 program hello implicit none integer::i,fib,n do i=0,n-1 write(*,*)fib(i) end do end program hello recursive function fib(n) result(s) implicit none integer::n,s if (n==0)then s=0; else if(n==1)then s=1 else s=fib(n-1)+fib(n-2) return end if end function
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Cosine series
A_002 THE GUASS SEIDEL
Find HM
A_04 SHOOTING METHOD
Taylors method of three order
A_04 SIMPSON'S RULE(3(I))
ascending sorting
A_01 FIXED_POINT_IM(II)
A_01 QN:1(I)
Random walk by using Monte Carlo method
Please log in to post a comment.