You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
27 lines
555 B
27 lines
555 B
7 months ago
|
// 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 = forLoopRecur(n)
|
||
|
fmt.Println("\n使用迭代模擬遞迴求和結果 res = ", res)
|
||
|
|
||
|
res = tailRecur(n, 0)
|
||
|
fmt.Println("\n尾遞迴函式的求和結果 res = ", res)
|
||
|
|
||
|
res = fib(n)
|
||
|
fmt.Println("\n費波那契數列的第", n, "項為", res)
|
||
|
}
|