
468 Design and Analysis of Algorithms
In the latter part of this chapter, we shall deal with problems having extremely large algorithmic gap.
Incidently, if we are searching for research topics in the algorithms fi eld, problems having large algorithmic
gap are good candidates!
17.3 EFFICIENCY AND TRACTABILITY
In previous chapters, we have encountered various algorithms with several degrees of complexity, some
reasonable, and some unreasonably high. For example, for mergesort it is O(n log
2
n), for matrix multiplication
it is O(n
3
), for Tower of Hanoi it is O(2
n
), for permutation of n numbers it is O(n!), and so on. The reader is
referred to ...