Fibonacci sequence: Difference between revisions
Content added Content deleted
(added MiniZinc) |
(→{{header|MiniZinc}}: refactoring) |
||
Line 7,765: | Line 7,765: | ||
let { |
let { |
||
array[0..n] of var int: fibonacci; |
array[0..n] of var int: fibonacci; |
||
constraint forall(a in 0..n)( |
constraint forall(a in 0..n)( |
||
fibonacci[a] = if (a == 0 \/ a == 1) then |
|||
a |
|||
⚫ | |||
else |
|||
fibonacci[a-1]+fibonacci[a-2] |
|||
endif |
|||
) |
|||
} in fibonacci[n]; |
|||
⚫ | |||
solve satisfy; |
solve satisfy; |
||
output [show( |
output [show(fib),"\n"];</lang> |
||
=={{header|MIPS Assembly}}== |
=={{header|MIPS Assembly}}== |