AlgorithmsUnlocked - (EPUB全文下载)

文件大小：2.35 mb。
文件格式：epub 格式。
书籍内容：

Algorithms Unlocked
Algorithms Unlocked
Thomas H. Cormen
The MIT PressCambridge, Massachusetts   London, England
© 2013 Massachusetts Institute of Technology
All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher.
MIT Press books may be purchased at special quantity discounts for business or sales promotional use. For information, please email special sales@mitpress.mit.edu or write to Special Sales Department, The MIT Press, 55 Hayward Street, Cambridge, MA 02142.
Library of Congress Cataloging-in-Publication Data
Cormen, Thomas H.Algorithms Unlocked / Thomas H. Cormen.   p. cmIncludes bibliographical references and index.ISBN 978-0-262-51880-2 (pbk. : alk. paper)1. Computer algorithms. I. Title.QA76.9.A43C685 2013005.1—dc23
2012036810
Epub 3.0
Contents
Preface
1    What Are Algorithms and Why Should You Care?
Correctness
Resource usage
Computer algorithms for non-computer people
Computer algorithms for computer people
Further reading
2     How to Describe and Evaluate Computer Algorithms
How to describe computer algorithms
How to characterize running times
Loop invariants
Recursion
Further reading
3    Algorithms for Sorting and Searching
Binary search
Selection sort
Insertion sort
Merge sort
Quicksort
Recap
Further reading
4    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
5    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
6    Shortest Paths
Dijkstra’s algorithm
The Bellman-Ford algorithm
The Floyd-Warshall algorithm
Further reading
7    Algorithms on Strings
Longest common subsequence
Transforming one string to another
String matching
Further reading
8    Foundations of Cryptography
Simple substitution ciphers
Symmetric-key cryptography
Public-key cryptography
The RSA cryptosystem
Hybrid cryptosystems
Computing random numbers
Further reading
9    Data Compression
Huffman codes
Fax machines
LZW compression
Further reading
10    Hard? Problems
Brown trucks
The classes P and NP and NP-completeness
Decision problems and reductions
A Mother Problem
A sampler of NP-complete proble ............

书籍插图：

以上为书籍内容预览，如需阅读全文内容请下载EPUB源文件，祝您阅读愉快。