Skip to content
Cart (0) Free shipping over $35*
Buybacks (0) Free shipping on buybacks
loading
Help Contact
Return rental ›

Algorithms Unlocked

Best in textbook rentals since 2012!

ISBN-10: 0262518805

ISBN-13: 9780262518802

Edition: 2013

Authors: Thomas H. Cormen

List price: $30.00
Blue ribbon 30 day, 100% satisfaction guarantee!
Sell
Get cash fast!
Marketplace
5 new & used from $5.70
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

Have you ever wondered how your GPS can find the fastest way to your destination,selecting one route from seemingly countless possibilities in mere seconds? How your credit cardaccount number is protected when you make a purchase over the Internet? The answer is algorithms.And how do these mathematical formulations translate themselves into your GPS, your laptop, or yoursmart phone? This book offers an engagingly written guide to the basics of computer algorithms. InAlgorithms Demystified, Thomas Cormen -- coauthor of the leading college textbookon the subject -- provides a general explanation, with limited mathematics, of how algorithms enablecomputers to solve problems. Readers will learn…    
Customers also bought

Book details

List price: $30.00
Copyright year: 2013
Publisher: MIT Press
Publication date: 3/1/2013
Binding: Paperback
Pages: 236
Size: 6.06" wide x 9.02" long x 0.59" tall
Weight: 0.924
Language: English

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms.

Preface
What Are Algorithms and Why Should You Care?
Correctness
Resource usage
Computer algorithms for non-computer people
Computer algorithms for computer people
Further reading
How to Describe and Evaluate Computer Algorithms
How to describe computer algorithms
How to characterize running times
Loop invariants
Recursion
Further reading
Algorithms for Sorting and Searching
Binary search
Selection sort
Insertion sort
Merge sort
Quicksort
Recap
Further reading
A Lower Bound for Sorting and How to Beat It
Rules for sorting
The lower bound on comparison sorting
Beating the lower bound with counting sort
Radix sort
Further reading
Directed Acyclic Graphs
Directed acyclic graphs
Topological sorting
How to represent a directed graph
Running time of topological sorting
Critical path in a PERT chart
Shortest path in a directed acyclic graph
Further reading
Shortest Paths
Dijkstra's algorithm
The Bellman-Ford algorithm
The Floyd-Warshall algorithm
Further reading
Algorithms on Strings
Longest common subsequence
Transforming one string to another
String matching
Further reading
Foundations of Cryptography
Simple substitution ciphers
Symmetric-key cryptography
Public-key cryptography
The RSA cryptosystem
Hybrid cryptosystems
Computing random numbers
Further reading
Data Compression
Huffman codes
Fax machines
LZW compression
Further reading
Hard? Problems
Brown trucks
The classes P and NP and NP-completeness
Decision problems and reductions
A Mother Problem
A sampler of NP-complete problems
General strategies
Perspective
Undecidable problems
Wrap-up
Further reading
Bibliography
Index
  • TextbookRush.com BBB Business Review
  • Trustpilot
Like TextbookRush on Facebook Follow TextbookRush on X Follow TextbookRush on Instagram Subscribe to TextbookRush on YouTube Follow TextbookRush on Pinterest Add TextbookRush on Snapchat Add TextbookRush on TikTok
© 2002-2024 TextbookRush
Subscribe