A Financial Problem
摘要
A problem originating in the financial domain is introduced that allows us to design three algorithms of increasing sophistication and elegance, evaluate their time complexity, and comment on their algorithmic properties. Here the concepts of asymptotic time complexity and worst case analysis will be made more precise and their impact on the question whether it is better to design a more efficient algorithm or to buy a faster computer is discussed in detail.