Search by title, author or ISBN

Introduction to Algorithms: Instructors Manual

Introduction to Algorithms: Instructors Manual by Thomas H. Cormen, ISBN: 9780070131446
Add an alert Add to a list

Add a alert

Enter prices below and click 'Add'. You will receive an alert when the book is available for less than the new or used price you specify.

Alert if:
Close

Add this book to a list

You can add this book to any one of your lists. Just select the list below, and click 'Add'.

Close
ISBN: 9780070131446
Publisher: Mcgraw-Hill College
Published: 1 June, 1990
Format: Paperback
Language: English
Editions: 11 other editions of this product

Please describe the issue

If you have noticed an incorrect price, image or just something you'd like to tell us, enter it below. Please include your email address if you'd like a reply.

Introduction to Algorithms: Instructors Manual

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.

NEW ITEMS
Prices in $USD ( Prices updated . )
Retailer Price Delivery Availability Total
BOOKO IS FINDING THE BEST PRICES FOR YOU.
WON'T BE A JIFFY...
USED ITEMS
Prices in $USD
Retailer Price Delivery Availability Total
BOOKO IS FINDING THE BEST PRICES FOR YOU.
WON'T BE A JIFFY...

Historical Prices

Loading...
This graph is for informational purposes only. Occasionally pricing data is captured incorrectly, through bugs in Booko or the stores supplying data, which may distort the graph, providing undue hope that even lower prices sometimes appear.

Recently Updated