Chet Ramey wrote:
seba wrote:
GNU bash, version 3.2.25(1)-release (i686-pc-linux-gnu)
Copyright (C) 2005 Free Software Foundation, Inc.

#!/bin/sh

fib() {
       n=$1
       [ $n == 0 -o $n == 1 ] && return $n
       fib $(($n-1))
       ret1=$?
       fib $(($n-2))
       ret2=$?
       return $(($ret1 + $ret2))
}

for ((i=0;$i<36;i++))
do
       fib $i
       echo "n=$i=>$?"
done

You managed to write yourself an infinitely-recursive function, and
eventually ran out of stack space.  `==' is a string operator, not a
numeric operator, when used with `['.

Why is [ 0 == 0 ] any more or less true than [ 0 -eq 0 ]?

The problem seems to be that this line is missing from the function:
local n ret1 ret2

Oh, and return values wrap at 255, so using the return code only works up to n=13. Use substitution ($()) and have the function 'echo' the result.

--
Matthew
"Who wants to sing?" -- Orcs (Warcraft II)



Reply via email to