1 / 984
文档名称:

Mcgraw-Hill - Introduction To Algorithms, 2Nd Edition.pdf

格式:pdf   页数:984
下载后只包含 1 个 PDF 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

Mcgraw-Hill - Introduction To Algorithms, 2Nd Edition.pdf

上传人:kuo08091 2014/1/14 文件大小:0 KB

下载得到文件列表

Mcgraw-Hill - Introduction To Algorithms, 2Nd Edition.pdf

文档介绍

文档介绍:Introduction to Algorithms, Second Edition
Thomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
Clifford Stein
The MIT Press
Cambridge , Massachusetts London, England
McGraw-Hill pany
Boston Burr Ridge , IL Dubuque , IA Madison , WI New York San Francisco St. Louis
Montréal Toronto
This book is one of a series of texts written by faculty of the Electrical Engineering and
Computer Science Department at the Massachusetts Institute of Technology. It was edited and
produced by The MIT Press under a joint production-distribution agreement with the
McGraw-Hill pany.
Ordering Information:
North America
Text orders should be addressed to the McGraw-Hill pany. All other orders should
be addressed to The MIT Press.
Outside North America
All orders should be addressed to The MIT Press or its local distributor.
Copyright © 2001 by The Massachusetts Institute of Technology
First edition 1990
All rights reserved. No part of this book may be reproduced in any form or by any electronic
or mechanical means (including photocopying, recording, or information storage and
retrieval) without permission in writing from the publisher.
This book was printed and bound in the United States of America.
Library of Congress Cataloging-in-Publication Data

Introduction to algorithms / Thomas H. Cormen ... [et al.].-2nd ed.
p. cm.
Includes bibliographical references and index.
ISBN 0-262-03293-7 (hc.: alk. paper, MIT Press).-ISBN 0-07-013151-1 (McGraw-Hill)
1. Computer programming. 2. Computer algorithms. I. Title: Algorithms. II. Cormen, Thomas
H.
I5858 2001
-dc21
2001031277
Preface
This book provides prehensive introduction to the modern study puter
algorithms. It presents many algorithms and covers them in considerable depth, yet makes
their design and analysis accessible to all levels of readers. We have tried to keep
explanations elementary without sacrificing depth of coverage or mathematical rig