O'Reilly logo

Discrete Structures, Logic, and Computability, 4th Edition by James L. Hein

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

chapter 5Analysis Tools and Techniques

Remember that time is money.

—Benjamin Franklin (1706-1790)

Time and space are important words in computer science because we want fast algorithms, and we want algorithms that don't use a lot of memory. The purpose of this chapter is to study some fundamental techniques and tools that can be used to analyze algorithms for the time and space they require. Although the study of algorithm analysis is beyond our scope, we'll give a brief introduction in the first section to help show the need for the mathematical topics in the rest of the chapter.

The rest of the chapter covers mathematical tools that have applications to the analysis of algorithms. We'll learn how to find closed forms for sums, as well as ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required