CHAPTER 16

Developing Efficient Algorithms

 

Objectives

  • To estimate algorithm efficiency using the Big O notation (§16.2).
  • To explain growth rates and why constants and nondominating terms can be ignored in the estimation (§16.2).
  • To determine the complexity of various types of algorithms (§16.3).
  • To analyze the binary search algorithm (§16.4.1).
  • To analyze the selection sort algorithm (§16.4.2).
  • To analyze the Towers of Hanoi algorithm (§16.4.3).
  • To describe common growth functions (constant, logarithmic, linear, log-linear, quadratic, cubic, and exponential) (§16.4.4).
  • To design efficient algorithms for finding Fibonacci numbers (§16.5).
  • To design efficient algorithms for finding gcd (§16.6).
  • To design efficient algorithms for finding ...

Get Introduction to Python Programming and Data Structures, 3rd Edition by Pearson now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial