Algorithms in Java

Sorting methods are critical components of many applications systems, and it is not unusual for special measures to be taken to make a sort as...

To begin, we shall consider a sorting method that is based on just two abstract operations: the compare–exchange operation and the perfect shuffle operation (along...

The simplest model for studying nonadaptive sorting algorithms is an abstract machine that can access the data only through compare– exchange operations. Such a machine...

The following amusing problem is a useful model for a variety of sorting applications. Suppose that a single driver is given the task of rearranging...

We move next to another kind of abstract sorting problem, which applies when the file to be sorted is much too large to fit in...

The general sort–merge strategy outlined in Section is effective in practice. In this section, we consider two improvements that can lower the costs. The first...

How do we get several independent processors to work together on the same sorting problem? Whether the processors control external memory devices or are complete...