lukasplevac/OpenMP-Examples
1
0
Fork 0
mirror of https://github.com/OpenMP/Examples.git synced 2025-04-23 06:11:22 +01:00
Code Issues Packages Projects Releases Wiki Activity

Fix computation of fibonacci numbers.

Browse Source
This commit is contained in:
Jakub Jelinek 2015-07-22 19:29:54 +02:00
parent 4b655aa21a
commit c64c683964
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
sources/Example_SIMD.7c.c
View File

@ -14,7 +14,7 @@ int a[N], b[N], c[N];
#pragma omp declare simd inbranch #pragma omp declare simd inbranch
int fib( int n ) int fib( int n )
{ {
if (n <= 2) if (n <= 1)
return n; return n;
else { else {
return fib(n-1) + fib(n-2); return fib(n-1) + fib(n-2);

4
sources/Example_SIMD.7f.f
View File

@ -21,7 +21,7 @@ program fibonacci
end do end do
write(*,*) "Done a(", N-1, ") = ", a(N-1) write(*,*) "Done a(", N-1, ") = ", a(N-1)
! 44 1134903168 ! 44 701408733
end program end program
recursive function fib(n) result(r) recursive function fib(n) result(r)
@ -29,7 +29,7 @@ recursive function fib(n) result(r)
implicit none implicit none
integer :: n, r integer :: n, r
if (n <= 2) then if (n <= 1) then
r = n r = n
else else
r = fib(n-1) + fib(n-2) r = fib(n-1) + fib(n-2)