Henry Venn (1796 1873) was an Anglican clergyman who, like his father and grandfather before him, was influential in the evangelical movement and campaigned for social reform, eradication of the slave trade, and better education and economic progress in the British colonies so as to enable them to become responsible for their own affairs. Venn was Secretary of the Church Missionary Society from 1841 to 1873, and alongside practical training and appointment of missionaries and ministers he spent time developing a theology of mission and principles for its practice. This book, published in its second edition in 1881, was edited by William Knight who had access to Venn's private journals and correspondence (from which he used substantial quotations), and met Venn's niece, who provided the portrait of her uncle used as the frontispiece of the book. The appendix contains some of Venn's own accounts of his early missionary work.

This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book.