This algorithms text from Neapolitan focuses on algorithms design and complexity analysis, assumes a background of college algebra and data structures but no calculus, and is suggested for a one-semester undergraduate course. The book is organized primarily by technique, with the first half introducing general design and analysis concepts and covering the divide-and-conquer, dynamic programming, and greedy approaches, as well as backtracking, branch-and-bound algorithms. Computational complexity is then introduced with the Sorting Problem, followed by the Searching Problem and leading into P and NP theory. Several specific algorithmic types and their appropriate applications round out the book, including genetic, number-theoretic, and parallel algorithms--the genetic algorithms being new for the fifth edition. Appendices review mathematical background and presents recurrence solving technique and disjoint set data structure necessary for a few chapter examples. Annotation ©2014 Ringgold, Inc., Portland, OR (protoview.com)