算法第四版：JAVA实现与深入解析

5星 · 超过95%的资源需积分: 10 157 浏览量更新于2024-07-29 1 收藏 23.94MB PDF 举报

"Addision.Wesley.Algorithms.4th.Edition.2011.pdf" 这本由Robert Sedgewick和Kevin Wayne合著的《算法》第四版是一本广泛认可的算法书籍，以Java语言作为实现基础。本书涵盖了算法设计、分析和实现的核心概念，适合计算机科学和软件工程领域的学生及专业人士阅读。书中的章节结构清晰，内容丰富，主要包括以下几个方面： 1. **基础**：这部分介绍了基本的编程模型，强调了数据抽象的重要性，以及如何使用袋子（Bags）、队列（Queues）和栈（Stacks）。此外，还详细讲解了算法分析的基础，包括运行时间复杂度的计算，并通过联合查找（Union-Find）案例进行了具体应用。 2. **排序**：这部分深入讨论了各种排序算法，如基础排序（Elementary Sorts），包括冒泡排序、选择排序等；归并排序（Mergesort）；快速排序（Quicksort）；优先队列（Priority Queues）的概念及其应用。 3. **搜索**：讲解了符号表（Symbol Tables）和不同的树结构，如二分查找树（Binary Search Trees）和平衡搜索树（Balanced Search Trees），如AVL树和红黑树。还涉及哈希表（Hash Tables）及其在实际问题中的应用。 4. **图论**：这部分涵盖了无向图和有向图，最小生成树（Minimum Spanning Trees）的构造算法，如Prim算法和Kruskal算法，以及最短路径问题的解决方案，如Dijkstra算法和Floyd-Warshall算法。 5. **字符串处理**：包括字符串排序（String Sorts）、Trie树（一种高效的字符串查找数据结构）、子串搜索算法（Substring Search），如KMP算法，以及正则表达式（Regular Expressions）和数据压缩技术。 6. **上下文**：最后，书中还提供了一个更广阔的应用背景，将所学的算法知识与实际问题联系起来，让读者理解算法在真实世界中的价值和意义。这本书不仅注重理论，还提供了许多实用的Java代码实现，有助于读者更好地理解和掌握算法。同时，书中也提到了可能存在的商标信息，并对使用书中信息或程序可能出现的错误或遗漏不承担任何明示或暗示的保证责任。《算法》第四版是学习和提升算法能力的重要参考资料，对于想要深入理解计算机科学核心原理的人来说是一本不可多得的经典著作。

ptg

he objective of this book is to study a broad variety of important and useful

algorithms—methods for solving problems that are suited for computer imple-

mentation. Algorithms go hand in hand with data structures—schemes for or-

ganizing data that leave them amenable to efﬁcient processing by an algorithm. This

chapter introduces the basic tools that we need to study algorithms and data structures.

First, we introduce our basic programming model. All of our programs are imple-

mented using a small subset of the Java programming language plus a few of our own

libraries for input/output and for statistical calculations. Section 1.1 is a summary of

language constructs, features, and libraries that we use in this book.

Next, we emphasize data abstraction, where we deﬁne abstract data types (ADTs) in

the service of modular programming. In Section 1.2 we introduce the process of im-

plementing an ADT in Java, by specifying an applications programming interface (API)

and then using the Java class mechanism to develop an implementation for use in client

code.

As important and useful examples, we next consider three fundamental ADTs: the

bag, the queue, and the stack. Section 1.3 describes APIs and implementations of bags,

queues, and stacks using arrays, resizing arrays, and linked lists that serve as models and

starting points for algorithm implementations throughout the book.

Performance is a central consideration in the study of algorithms. Section 1.4 de-

scribes our approach to analyzing algorithm performance. The basis of our approach is

the scientiﬁc method: we develop hypotheses about performance, create mathematical

models, and run experiments to test them, repeating the process as necessary.

We concl ude w it h a c ase s tudy wh ere we co nsid er solu tion s to a connectivity problem

that uses algorithms and data structures that implement the classic union-ﬁnd ADT.

From <www.wowebook.com>

ptg

A l g o r i t h m s When we write a computer program, we are generally implementing a

method that has been devised previously to solve some problem. This method is often

independent of the particular programming language being used—it is likely to be

equally appropriate for many computers and many programming languages. It is the

method, rather than the computer program itself, that speciﬁes the steps that we can

take to solve the problem. The term algorithm is used in computer science to describe

a ﬁnite, deterministic, and effective problem-solving method suitable for implementa-

tion as a computer program. Algorithms are the stuff of computer science: they are

central objects of study in the ﬁeld.

We ca n de ﬁne an al gor ithm by d esc rib ing a pro cedure fo r so lvi ng a prob lem in a

natural language, or by writing a computer program that implements the procedure,

as shown at right for Euclid’s algorithm for ﬁnding the greatest common divisor of

two numbers, a variant of which was devised

over 2,300 years ago. If you are not familiar

with Euclid’s algorithm, you are encour-

aged to work Exercise 1.1.24 and Exercise

1.1.25, perhaps after reading Section 1.1. In

this book, we use computer programs to de-

scribe algorithms. One important reason for

doing so is that it makes easier the task of

checking whether they are ﬁnite, determin-

istic, and effective, as required. But it is also

important to recognize that a program in a

particular language is just one way to express

an algorithm. The fact that many of the al-

gorithms in this book have been expressed

in multiple programming languages over the

past several decades reinforces the idea that each algorithm is a method suitable for

implementation on any computer in any programming language.

Most algorithms of interest involve organizing the data involved in the computa-

tion. Such organization leads to data structures, which also are central objects of study

in computer science. Algorithms and data structures go hand in hand. In this book we

take the view that data structures exist as the byproducts or end products of algorithms

and that we must therefore study them in order to understand the algorithms. Simple

algorithms can give rise to complicated data structures and, conversely, complicated

algorithms can use simple data structures. We shall study the properties of many data

structures in this book; indeed, we might well have titled the book Algorithms and Data

Structures.

Compute the greatest common divisor of

two nonnegative integers p and q as follows:

If q is 0, the answer is p. If not, divide p by q

and take the remainder r. The answer is the

greatest common divisor of q and r.

public static int gcd(int p, int q)

{

if (q == 0) return p;

int r = p % q;

return gcd(q, r);

}

Euclid’s algorithm

Java-language description

English-language description

4 CHAPTER 1

■

Fundamentals

From <www.wowebook.com>

ptg

When we use a computer to help us solve a problem, we typically are faced with a

number of possible approaches. For small problems, it hardly matters which approach

we use, as long as we have one that correctly solves the problem. For huge problems (or

applications where we need to solve huge numbers of small problems), however, we

quickly become motivated to devise methods that use time and space efﬁciently.

The primary reason to learn about algorithms is that this discipline gives us the

potential to reap huge savings, even to the point of enabling us to do tasks that would

otherwise be impossible. In an application where we are processing millions of objects,

it is not unusual to be able to make a program millions of times faster by using a well-

designed algorithm. We shall see such examples on numerous occasions throughout

the book. By contrast, investing additional money or time to buy and install a new

computer holds the potential for speeding up a program by perhaps a factor of only 10

or 100. Careful algorithm design is an extremely effective part of the process of solving

a huge problem, whatever the applications area.

When developing a huge or complex computer program, a great deal of effort must

go into understanding and deﬁning the problem to be solved, managing its complex-

ity, and decomposing it into smaller subtasks that can be implemented easily. Often,

many of the algorithms required after the decomposition are trivial to implement. In

most cases, however, there are a few algorithms whose choice is critical because most

of the system resources will be spent running those algorithms. These are the types of

algorithms on which we concentrate in this book. We study fundamental algorithms

that are useful for solving challenging problems in a broad variety of applications areas.

The sharing of programs in computer systems is becoming more widespread, so

although we might expect to be using a large fraction of the algorithms in this book, we

also might expect to have to implement only a small fraction of them. For example, the

Java libraries contain implementations of a host of fundamental algorithms. However,

implementing simple versions of basic algorithms helps us to understand them bet-

ter and thus to more effectively use and tune advanced versions from a library. More

important, the opportunity to reimplement basic algorithms arises frequently. The pri-

mary reason to do so is that we are faced, all too often, with completely new computing

environments (hardware and software) with new features that old implementations

may not use to best advantage. In this book, we concentrate on the simplest reasonable

implementations of the best algorithms. We do pay careful attention to coding the criti-

cal parts of the algorithms, and take pains to note where low-level optimization effort

could be most beneﬁcial.

The choice of the best algorithm for a particular task can be a complicated process,

perhaps involving sophisticated mathematical analysis. The branch of computer sci-

ence that comprises the study of such questions is called analysis of algorithms. Many

5CHAPTER 1

■

Fundamentals

From <www.wowebook.com>

ptg

of the algorithms that we study have been shown through analysis to have excellent

theoretical performance; others are simply known to work well through experience.

Our primary goal is to learn reasonable algorithms for important tasks, yet we shall also

pay careful attention to comparative performance of the methods. We should not use

an algorithm without having an idea of what resources it might consume, so we strive

to be aware of how our algorithms might be expected to perform.

Summary of topics As an overview, we describe the major parts of the book, giv-

ing speciﬁc topics covered and an indication of our general orientation toward the

material. This set of topics is intended to touch on as many fundamental algorithms as

possible. Some of the areas covered are core computer-science areas that we study in

depth to learn basic algorithms of wide applicability. Other algorithms that we discuss

are from advanced ﬁelds of study within computer science and related ﬁelds. The algo-

rithms that we consider are the products of decades of research and development and

continue to play an essential role in the ever-expanding applications of computation.

Fundamentals (Chapter 1) in the context of this book are the basic principles and

methodology that we use to implement, analyze, and compare algorithms. We consider

our Java programming model, data abstraction, basic data structures, abstract data

types for collections, methods of analyzing algorithm performance, and a case study.

Sorting algorithms (Chapter 2) for rearranging arrays in order are of fundamental

importance. We consider a variety of algorithms in considerable depth, including in-

sertion sort, selection sort, shellsort, quicksort, mergesort, and heapsort. We also en-

counter algorithms for several related problems, including priority queues, selection,

and merging. Many of these algorithms will ﬁnd application as the basis for other algo-

rithms later in the book.

Searching algorithms (Chapter 3) for ﬁnding speciﬁc items among large collections

of items are also of fundamental importance. We discuss basic and advanced methods

for searching, including binary search trees, balanced search trees, and hashing. We

note relationships among these methods and compare performance.

Graphs (Chapter 4) are sets of objects and connections, possibly with weights and

orientation. Graphs are useful models for a vast number of difﬁcult and important

problems, and the design of algorithms for processing graphs is a major ﬁeld of study.

We con side r d epth -ﬁrs t s earch , bre adt h-ﬁr st se arch, co nnec tiv it y p ro ble ms, a nd s ev -

eral algorithms and applications, including Kruskal’s and Prim’s algorithms for ﬁnding

minimum spanning tree and Dijkstra’s and the Bellman-Ford algorithms for solving

shortest-paths problems.

6 CHAPTER 1

■

Fundamentals

From <www.wowebook.com>

剩余968页未读，继续阅读

rootfs

粉丝: 21
资源: 146

算法第四版：JAVA实现与深入解析

《Android开发者手册》- 构建Android应用程序

the-ios5-developer-cookbook-3rd-edition.pdf

快速康复外科现状.ppt

快速康复外科幻灯.ppt

Spring MVC架构详解与配置指南：实现Web应用的高效开发

基于golang的渗透测试武器，将web打点部分与常规的漏扫部分进行整合与改进.zip

渗透测试与搭建.zip

【java毕业设计】野生动物公益保护系统源码（ssm+mysql+说明文档+LW）.zip

【java毕业设计】易商B2C网上交易系统ssh+mysql源码（完整前后端+说明文档+LW）.zip

网站渗透测试系统.zip

最新资源