Compared to What? An Introduction to the Anaylsis of Algorithms (Principles of Computer Science Series)

Gregory J.E. Rawlins

ISBN 10: 071678243X / ISBN 13: 9780716782438

Published by W. H. Freeman/Computer Science Press, New York, 1992

About this Item

From the U of Indiana website: "Gregory J E Rawlins left a childhood on the shores of Trinidad to study computer science in the wilds of Waterloo, Canada He now finds himself a professor of computer science at Indiana University, Bloomington, smoking far too many cigarettes Surrounded by several thousand books, he works in the gentle glare of his computer monitors, reading, writing, and supporting Bloomington bookstore owners in the style to which they have become accustomed The benevolence of an overindulgent public has encouraged him to write, then publish, several books over the years Besides regularly springing his books upon a trusting and unsuspecting public, he also delights in speaking on the future of electronic publishing and other aspects of the economics and sociology of computer technology A research scientist by profession, he toils in the fields of artificial intelligence, making genetic algorithms his particular interest He may yet learn to drive" This copy is in fine condition with no marks or damage at all to either the book or the DJ, which is in a protective mylar cover "Gift Quality" 536 pp.

Seller Inventory # AA1116

Bibliographic Details

• Title: Compared to What? An Introduction to the Anaylsis of Algorithms (Principles of Computer Science Series)
• Publisher: W. H. Freeman/Computer Science Press, New York
• Publication Date: 1992
• Language: English
• ISBN 10: 071678243X
• ISBN 13: 9780716782438
• Binding: Hardcover
• Edition: 2nd Printing.
• Condition: Fine
• Dust Jacket Condition: Fine

About this title

Synopsis

compared to what? covers all the basics of algorithm analysis but it does not just supply algorithms to memorize - it lets you guide your students through the process of breaking down and solving aigolithmic problems. The invaluable analytic skills developed through this innovative approach will appiv to anj, programming assignment-no matter the size of the problem or the language and macnine used. The book does not assume a high degree of familiarity with discrete mathematics-in fact, all mathematical concepts crucial to algorithm analysis are explained in the appendices. Each chapter centers on a basic problem and works through a variety of available . options for its solution rather than declaring a single best answer. Within the chapters, carefully orchestrated. 'Pauses'-helpful questions and strategy suggestions-point students to workable solutions and to increasinglv more advanced variations and applications. End-of-chapter 'Codas' restate each chapter's major themes and guide the transition into the next set of problems. Compared to What? will help students analyze problems, determine what needs to be optimized, and pinpoint inefficiencies and inaccuracies in their programs. Its fr-iendlv but challenging style, inventive examples 'and analogies, descriptions of state-of-the-art applications, and pragmatic focus will help you teach students to create algorithmic solutions-not merely memorize them.