## Posts Tagged ‘**algodesignmanual**’

## Skiena on Divide-and-Conquer

Beyond binary search and its many variants, however, I find it [divide-and-conquer] to be a difficult design technique to apply in practice.

Steven Skiena, “The Algorithm Design Manual”, 2nd. edition, page 135.

## Skiena on Sorting

Sorting can be used to illustrate most algorithm design paradigms. Data structure techniques, divide-and-conquer, randomization, and incremental construction all lead to efficient sorting algorithms.

Steven Skiena, “The Algorithm Design Manual”, 2nd. edition, page 130.