DEVELOPING EFFICIENT ALGORITHMS - Introduction to Java Programming: Comprehensive Version - page 821

CHAPTER

22

D EVELOPING E FFICIENT

A LGORITHMS

Objectives

To estimate algorithm efficiency using the Big O notation (§22.2).

■

To explain growth rates and why constants and nondominating terms
can be ignored in the estimation (§22.2).

■

To determine the complexity of various types of algorithms (§22.3).

■

To analyze the binary search algorithm (§22.4.1).

■

To analyze the selection sort algorithm (§22.4.2). ■

To analyze the Tower of Hanoi algorithm (§22.4.3).

■

To describe common growth functions (constant, logarithmic, log-
linear, quadratic, cubic, exponential) (§22.4.4).

■

To design efficient algorithms for finding Fibonacci numbers using
dynamic programming (§22.5).

■

To find the GCD using Euclid's algorithm (§22.6).

■

To find prime numbers using the sieve of Eratosthenes (§22.7).

■

To design efficient algorithms for finding the closest pair of points
using the divide-and-conquer approach (§22.8).

■

To solve the Eight Queens problem using the backtracking approach
(§22.9).

■

To design efficient algorithms for finding a convex hull for a set of
points (§22.10).

■