1 / 560
文档名称:

C++ Addison Wesley - Computing - Algorithms by Robert Sedgewick(1).pdf

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

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

C++ Addison Wesley - Computing - Algorithms by Robert Sedgewick(1).pdf

上传人:bolee65 2014/2/4 文件大小:0 KB

下载得到文件列表

C++ Addison Wesley - Computing - Algorithms by Robert Sedgewick(1).pdf

文档介绍

文档介绍:ALGORITHMS
ROBERT SEDGEWICK
BROWN UNNER!MY
ADDISON-WESLEY PANY
Reading, Massachusetts l Menlo Park, California
London l Amsterdam l Don Mills, Ontario l Sydney
To Adam, Brett, Robbie
and especially Linda
This book is in the
Addison-Wesley Series puter Science
Consulting Editor
Michael A. Harrison
Sponsoring Editor
James T. DeWolfe
Library of Congress Cataloging in Publication Data
Sedgewick, Robert, 1946-
Algorithms.
1. Algorithms. I. Title.
1983 82-11672
ISBN O-201 -06672-6
Reproduced by Addison-Wesley from camera-ready copy supplied by the author.
Reprinted with corrections, August 1984
Copyright 0 1983 by Addison-Wesley pany, Inc.
All rights reserved. No part of this publication may be reproduced, stored in
a retrieval system, or transmitted, in any form or by any means, electronic,
mechanical, photocopying, recording, or otherwise, without prior written per-
mission of the publisher. Printed in the United States of America.
ISBN o-201-06672-6
FGHIJ-HA-8987654
Preface
This book is intended to survey the most important algorithms in use on
computers today and to teach fundamental techniques to the growing number
of people who are interested in ing puter users. It is ap-
propriate for use as a textbook for a second, third or fourth course puter
science: after students have acquired some programming skills and familiarity
puter systems, but before they have specialized courses in advanced
areas puter science puter applications. Additionally, the book
may be useful as a reference for those who already have some familiarity with
the material, since it contains a number puter implementations of useful
algorithms.
The book consists of forty chapters which are grouped into seven major
parts: mathematical algorithms, sorting, searching, string processing, geomet-
ric algorithms, graph algorithms and advanced topics. A major goal in the
development of this book has been to bring together the fundamental