Algorithms in Java

Developing abstract models for our data and for the ways in which our programs process those data is an essential ingredient in the process of...

Suppose that we wish to modify Programs and to count the number of pairs of points that fall within a square of size d. First,...

The data structures that we use in applications often contain a great deal of information of various types, and certain pieces of information may belong...

Of the data types that support insert and remove for collections of items, the most important is called the pushdown stack. A stack operates somewhat like...

We shall see a great many applications of stacks in the chapters that follow. As an introductory example, we now consider the use of stacks...

In this section, we consider two implementations of the stack ADT: one using arrays and one using linked lists. The implementations are both straightforward applications...

How can we develop one stack implementation that allows us to build both a stack of integers and a stack of characters as required, for...

Sections through present a complete example of Java code that captures one of our most important abstractions: the pushdown stack. The interface in Section defines...

The first-in, first-out (FIFO) queue is another fundamental ADT that is similar to the pushdown stack but uses the opposite rule to decide which element...

For many applications, the abstract items that we process are unique, a quality that leads us to consider modifying our idea of how stacks, FIFO...

ADTs help us manage the complexity of creating client programs that address the needs of increasingly more complicated applications by building increasingly powerful layers of...

As a final example, we consider in this section an application-specific ADT that is representative of the relationship between application domains and the algorithms and...

There are three primary reasons for us to be aware of the fundamental concepts underlying ADTs as we embark on the study of algorithms and...