Ship-Ship-Hooray! Free Shipping on $25+ Details >
Intro. to Analysis of Algorithms

Intro. to Analysis of Algorithms - 2nd edition

Intro. to Analysis of Algorithms - 2nd edition

ISBN13: 9780321905758

ISBN10: 032190575X

Intro. to Analysis of Algorithms by Sedgewick - ISBN 9780321905758
Cover type: Hardback
Edition: 2ND 13
Copyright: 2013
Publisher: Addison-Wesley Longman, Inc.
International: No
Intro. to Analysis of Algorithms by Sedgewick - ISBN 9780321905758

ISBN13: 9780321905758

ISBN10: 032190575X

Cover type: Hardback
Edition: 2ND 13

List price: $79.99

Happy you, happy us. You get 24-hour turnaround. Free shipping on $25+, and dedicated customer service. Cue the smiley faces.

Ships directly from us
You Save $36.09 (45%)

List price: $79.99

Instant access, flexible term options, and deep discounts up to 60% on digital content! Happy you, happy us.

Delivered via email within 1 hour
Expires after 365 days
You Save $16.00 (20%)
Format: Vitalsource
Use for 365 days

Please note: eTextbooks do not come with access codes, CDs/DVDs, workbooks, and other supplemental items.
Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Other Editions of Intro. to Analysis of Algorithms

shop us with confidence


Despite growing interest in the mathematical analysis of algorithms, basic information on methods and models has rarely been directly accessible to practitioners, researchers, or students. This book organizes and presents that knowledge, fully introducing today's primary techniques for mathematically analyzing algorithms.

Robert Sedgewick and the late Philippe Flajolet have drawn from both classical mathematical and computer science material, integrating discrete mathematics, elementary real analysis, combinatorics, algorithms, and data structures. They focus on ''average-case'' or ''probabilistic'' analysis, while also covering tools for ''worst case'' or ''complexity'' analysis. Improvements in this edition include:

* Upgraded figures and code

* Newer style for presenting much of the text's math

* An all-new chapter on trees

This book's thorough, self-contained coverage will help readers appreciate the field's challenges, prepare them for advanced results covered in Donald Knuth's books, and provide the background they need to keep abreast of new research. Coverage includes: recurrences, generating functions, asymptotics, trees, strings, maps, sorting, tree search, string search, and hashing algorithms. Ideal for junior- or senior-level courses on mathematical analysis of algorithms, this book will also be useful in courses on discrete mathematics for computer scientists, and in introducing mathematics students to computer science principles related to algorithms and data structures.

Digital Rights

eBook Requirements
VitalSource Bookshelf Reader
Minimum System Requirements:
  • Windows 7/8, or Mac OS X 10.6 or above
Software Requirements:

eTextbooks and eChapters can be viewed by using the free reader listed below.

Be sure to check the format of the eTextbook/eChapter you purchase to know which reader you will need. After purchasing your eTextbook or eChapter, you will be emailed instructions on where and how to download your free reader.

Download Requirements:

Due to the size of eTextbooks, a high-speed Internet connection (cable modem, DSL, LAN) is required for download stability and speed. Your connection can be wired or wireless.

Being online is not required for reading an eTextbook after successfully downloading it. You must only be connected to the Internet during the download process.

User Help:

Click Here to access the VitalSource Bookshelf FAQ

Digital Rights
Copying: Allowed, 2 selections may be copied every 365 days
Printing: Allowed, 2 prints for 365 days
Expires: Yes, may be used for 365 days after activation
Reading Aloud: Allowed
Sharing: Not Allowed
Min. Software Version: Online: No additional software required
Offline: VitalSource Bookshelf

Suitable Devices: PCs, Tablet PCs, Macs, Laptops

Digital Rights Management (DRM) Key

Copying - Books that cannot be copied will show "Not Allowed." Otherwise, this will detail the number of times it can be copied, or "Allowed with no limits."

Printing - Books that cannot be printed will show "Not Allowed." Otherwise, this will detail the number of times it can be printed, or "Allowed with no limits."

Expires - Books that have no expiration (the date upon which you will no longer be able to access your eBook) will read "No Expiration." Otherwise it will state the number of days from activation (the first time you actually read it).

Reading Aloud - Books enabled with the "text-to-speech" feature so that they can be read aloud will show "Allowed."

Sharing - Books that cannot be shared with other computers will show "Not Allowed."

Min. Software Version - This is the minimum software version needed to read this book.

Suitable Devices - Hardware known to be compatible with this book. Note: Reader software still needs to be installed.

Other Editions of Intro. to Analysis of Algorithms

Introduction to the Analysis of Algorithms by Robert Sedgewick - ISBN 9780201400090