Algorithm synthesis: a comparative study
The goal of this book is to study the decisions made in algorithm design. The authors have chosen seven algorithms for which several derivations exist in the literature: insertion sort, quicksort, Cartesian set product, depth-first search in a directed graph, Schorr-Waite graph marking, N-queens, and convex hull. For each of these, the book compares several of the published derivations for design decisions made (such as linear vs. binary insertion sort), the amount of derivation detail given (was the algorithm derived from problem specification or merely stated? were alternative designs discussed and, if so, were the reasons for the design decisions and/or the order in which the alternatives were examined stated?), implementation (was the algorithm programmed and, if so, in what language?), and other aspects of the presentation (was a computer code given? was the algorithm presented as a pseudo-code and, if so, in what pseudo-language?). This book does not compare the various versions of the algorithms for efficiency: it is not meant as a guide to programmers in choosing between algorithms, but rather as an appeal to authors to standardize algorithm presentation and to give adequate information on the thought processes involved in designing algorithms.
This page was built for publication: Algorithm synthesis: a comparative study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4692629)