宅學習 - Social Learning Space 社交學習空間@FJU CSIE

"根據Quiz2..

1. tail-recursion (P51)

2. Iterative algorithms execute faster than tail-recursion version because

no stackneeds to be maintained(P51)

3. In-place sort is a sorting algorithm that does not use any extra space

beyond that

needed to store the input(P57)

4. Divide and conquer steps (p59)

5. Threshold(P71)

6. cycle(contain a cycle),otherwise acyclic(p97)

7. trace(p105)

8. The first step in the development of a dynamic programming algorithm

is to establish a recursive property(p105)

9. Dynamic programming applies in the Traveling Salesman Problem

10. depth = Level(p116)"