Algorithms in Java

The concept of recursion is fundamental in mathematics and computer science. The simple definition is that a recursive program in a programming language is one...

A recursive algorithm is one that solves a problem by solving one or more smaller instances of the same problem. To implement recursive algorithms in...

Many of the recursive programs that we consider in this book use two recursive calls, each operating on about one-half of the input. This recursive...

An essential characteristic of the divide-and-conquer algorithms that we considered in Section is that they partition the problem into independent subproblems. When the subproblems are...

are a mathematical abstraction that play a central role in the design and analysis of algorithms because We use trees to describe dynamic properties of algorithms. We...

Before beginning to consider tree-processing algorithms, we continue in a mathematical vein by considering a number of basic properties of trees. We focus on binary...

Before considering algorithms that construct binary trees and trees, we consider algorithms for the most basic tree-processing function: tree traversal: Given a (reference to) a...

The tree-traversal algorithms that we considered in Section exemplify the basic fact that we are led to consider recursive algorithms for binary trees, because of...

For our final example of a recursive program in this chapter, we consider one of the most important of all recursive programs: recursive graph traversal,...

Recursion lies at the heart of early theoretical studies into the nature of computation. Recursive functions and programs play a central role in mathematical studies...