int fib $($int n$)\{$

if $($n $<=1)$ return $1$;

$//$ Using recursion to find the fibonacci value

return fib$($n$-1)+$ fib$($n$-2)$;

$\}$