The recursive Fibonacci function can be transformed into a tail-recursive variant: The Lua interpreter detects and optimizes tail calls.
確定！ 回上一頁
