
402 Design and Analysis of Algorithms
17. O notation see Key Terms in Chapter 4.
18. Order notation see Key Terms in Chapter 4.
19. Profi ling see Key Terms in Chapter 1.
20. Tail recursion is a special case of recur-
sion that can be easily transformed into an
iteration. Replacing recursion with iteration,
either manually or automatically, drastically
decreases the amount of stack space used and
improves effi ciency.
21. Tight bound a bound that is nearer to the
actual running time.
22. Tractable and non-tractable algorithms
see Key Terms in Chapter 17.
23. Trie see Key Terms in Chapter 15.
24. Upper bound see Key Terms in Chapter ...