没有合适的资源?快使用搜索试试~ 我知道了~
Algorithms in Java, Parts 1-4(3rd) 无水印pdf
4星 · 超过85%的资源 需积分: 9 37 下载量 102 浏览量
2017-11-29
15:47:29
上传
评论 3
收藏 15.58MB PDF 举报
温馨提示
试读
764页
Algorithms in Java, Parts 1-4(3rd) 英文无水印pdf 第3版 pdf所有页面使用FoxitReader和PDF-XChangeViewer测试都可以打开 本资源转载自网络,如有侵权,请联系上传者或csdn删除 本资源转载自网络,如有侵权,请联系上传者或csdn删除
资源推荐
资源详情
资源评论
Algorithms
Java
in
T H I R D E D I T I O N
P A R T S 1 – 4
F U N D A M E N T A L S
D A T A S T R U C T U R E S
S O R T I N G
S E A R C H I N G
Robert Sedgewick
Princeton University
Addison-Wesley
Boston • San Francisco • New York • Toronto • Montreal
London • Munich • Paris • Madrid
Capetown • Sydney • Tokyo • Singapore • Mexico City
Many of the designations used by manufacturers and sellers to distinguish their products are claimed
as trademarks. Where those designations appear in this book and Addison-Wesley was aware of a
trademark claim, the designations have been printed in initial capital letters or all capitals.
The author and publisher have taken care in the preparation of this book, but make no expressed or
implied warranty of any kind and assume no responsibility for errors or omissions. No liability is
assumed for incidental or consequential damages in connection with or arising out of the use of the
information or programs contained herein.
The publisher offers discounts on this book when ordered in quantity for special sales. For more
information, please contact:
U. S. Corporate and Government Sales
(800) 382-3410
corpsales@pearsontechgroup.com.
For sales outside of the United States, please contact:
International Sales
(317) 581-3793
international@pearsontechgroup.com
Visit Addison-Wesley on the Web: www.awprofessional.com
Library of Congress Cataloging-in-Publication Data
Sedgewick, Robert, 1946 –
Algorithms in Java / Robert Sedgewick. — 3d ed.
p. cm.
ISBN 0-201-36120-5 (alk. paper)
Includes bibliographical references and index.
Contents: v. 1, pts. 1–4. Fundamentals, data structures, sorting, searching.
1. Java (Computer program language) 2. Computer algorithms.
I. Title.
QA76.73.C15S 2003
005.13’3—dc20 92-901
CIP
Copyright
c
! 2003 by Pearson Education, 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 the prior written permission of the publisher. Printed in the United States of
America. Published simultaneously in Canada.
For information on obtaining permission for use of material from this work, please submit a written
request to:
Pearson Education, Inc.
75 Arlington Street, Suite 300
Boston, MA 02116
Fax: (617) 848-7047
corpsales@pearsontechgroup.com
Printing
9th February 2008
Text printed in the United States on recycled paper at Courier Stoughton in Stoughton, Massachusetts.
ISBN 0-201-36120-5
Preface
T
HIS BOOK IS the first of three volumes that are intended to
survey the most important computer algorithms in use today.
This first volume (Parts 1–4) covers fundamental concepts (Part 1),
data structures (Part 2), sorting algorithms (Part 3), and searching
algorithms (Part 4); the second volume (Part 5) covers graphs and
graph algorithms; and the (yet to be published) third volume (Parts
6–8) covers strings (Part 6), computational geometry (Part 7), and
advanced algorithms and applications (Part 8).
The books are useful as texts early in the computer science cur-
riculum, after students have acquired basic programming skills and
familiarity with computer systems, but before they have taken spe-
cialized courses in advanced areas of computer science or computer
applications. The books also are useful for self-study or as a refer-
ence for people engaged in the development of computer systems or
applications programs because they contain implementations of useful
algorithms and detailed information on these algorithms’ performance
characteristics. The broad perspective taken makes the series an ap-
propriate introduction to the field.
Together the three volumes comprise the Third Edition of a book
that has been widely used by students and programmers around the
world for many years. I have completely rewritten the text for this
edition, and I have added thousands of new exercises, hundreds of
new figures, dozens of new programs, and detailed commentary on all
the figures and programs. This new material provides both coverage of
new topics and fuller explanations of many of the classic algorithms. A
new emphasis on abstract data types throughout the books makes the
programs more broadly useful and relevant in modern object-oriented
programming environments. People who have read previous editions
will find a wealth of new information throughout; all readers will
find a wealth of pedagogical material that provides effective access to
essential concepts.
iii
P R E F A C E
These books are not just for programmers and computer science
students. Everyone who uses a computer wants it to run faster or to
solve larger problems. The algorithms that we consider represent a
body of knowledge developed during the last 50 years that is the basis
for the efficient use of the computer for a broad variety of applications.
From N -body simulation problems in physics to genetic-sequencing
problems in molecular biology, the basic methods described here have
become essential in scientific research; and from database systems to
Internet search engines, they have become essential parts of modern
software systems. As the scope of computer applications becomes more
widespread, so grows the impact of basic algorithms. The goal of this
book is to serve as a resource so that students and professionals can
know and make intelligent use of these fundamental algorithms as the
need arises in whatever computer application they might undertake.
Scope
This book, Algorithms in Java, Third Edition, Parts 1-4, contains 16
chapters grouped into four major parts: fundamentals, data structures,
sorting, and searching. The descriptions here are intended to give
readers an understanding of the basic properties of as broad a range
of fundamental algorithms as possible. The algorithms described here
have found widespread use for years, and represent an essential body
of knowledge for both the practicing programmer and the computer-
science student. The second volume is devoted to graph algorithms,
and the third consists of four additional parts that cover strings, geom-
etry, and advanced topics. My primary goal in developing these books
has been to bring together fundamental methods from these areas, to
provide access to the best methods known for solving problems by
computer.
You will most appreciate the material here if you have had one
or two previous courses in computer science or have had equivalent
programming experience: one course in programming in a high-level
language such as Java, C, or C
++
, and perhaps another course that
teaches fundamental concepts of programming systems. This book
is thus intended for anyone conversant with a modern programming
language and with the basic features of modern computer systems.
iv
剩余763页未读,继续阅读
资源评论
- georgesuperman2021-03-20thanks for sharing!
yinkaisheng-nj
- 粉丝: 763
- 资源: 6953
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功