O'Reilly logo

Design and Analysis of Algorithms by Himanshu B. Dave, Parag H. Dave

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 14

Efficiency of Algorithms

Objectives

After reading this chapter, you should understand:

  • The meaning, need and factors affecting efficiency
  • Characteristics of a Good Solution
  • Significance of differentiating between Polynomial and Non-Polynomial time algorithms
  • Effect of improvement in Computer Hardware on Algorithm Running Times
  • Worst and Average Case Behaviour of Algorithms
  • How to perform Timing Analysis of Simple Algorithms
  • Recursion: its implications for efficiency
  • Tail Recursion: How it dramatically improves efficiency
  • Complexity Theory : The Notion of a Resource
  • Complexity Classes: Tractable and Intractable Algorithms
  • The Step Counting Principle : Basis for Deriving Complexity
  • Execution Time : Straight Line Programs, Recursive ...

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