// File: recursion_test.go
// Created Time: 2023-08-28
// Author: Reanon (793584285@qq.com)

package chapter_computational_complexity

import (
	"fmt"
	"testing"
)

/* Driver Code */
func TestRecursion(t *testing.T) {
	n := 5
	res := recur(n)
	fmt.Println("\n递归函数的求和结果 res = ", res)

	res = tailRecur(n, 0)
	fmt.Println("\n尾递归函数的求和结果 res = ", res)

	res = fib(n)
	fmt.Println("\n斐波那契数列的第", n, "项为", res)
}
