作者:
Robert Sedgewick
/
Kevin Wayne 出版社: Addison-Wesley Professional 副标题: An Interdisciplinary Approach 原作名: Computer Science: An Interdisciplinary Approach 出版年: 2016-6-15 页数: 1168 定价: GBP 58.99 装帧: Hardcover ISBN: 9780134076423
Robert Sedgewick 是普林斯顿大学计算机科学系教授，从1985年开始担任系主任。他于斯坦福大学获得博士学位，师从计算机科学界泰斗高德纳教授。他曾任Adobe公司的董事，并曾在Xerox PARC、IDA和INRIA公司担任研究员。他所编写的《算法》系列书籍令大批计算机学习者受益匪浅。
Kevin Wayne 自1998年开始在普林斯顿大学计算机科学系任教，曾荣获2014年ACM杰出教育奖以及普林大学大学多个教学方面的奖项。
Sedgewick 和 Wayne 一起开设计算机导论和数据结构与算法的入门课程，他们共同开设的MOOC课程已吸引了超过100万的学习者。
目录
· · · · · ·
Preface xiii
Chapter 1: Elements of Programming 1
1.1 Your First Program 2
1.2 Built-in Types of Data 14
1.3 Conditionals and Loops 50
1.4 Arrays 90
· · · · · ·
(更多)
Preface xiii
Chapter 1: Elements of Programming 1
1.1 Your First Program 2
1.2 Built-in Types of Data 14
1.3 Conditionals and Loops 50
1.4 Arrays 90
1.5 Input and Output 126
1.6 Case Study: Random Web Surfer 170
Chapter 2: Functions and Modules 191
2.1 Defining Functions 192
2.2 Libraries and Clients 226
2.3 Recursion 262
2.4 Case Study: Percolation 300
Chapter 3: Object-Oriented Programming 329
3.1 Using Data Types 330
3.2 Creating Data Types 382
3.3 Designing Data Types 428
3.4 Case Study: N-Body Simulation 478
Chapter 4: Algorithms and Data Structures 493
4.1 Performance 494
4.2 Sorting and Searching 532
4.3 Stacks and Queues 566
4.4 Symbol Tables 624
4.5 Case Study: Small-World Phenomenon 670
Chapter 5: Theory of Computing 715
5.1 Formal Languages 718
5.2 Turing Machines 766
5.3 Universality 786
5.4 Computability 806
5.5 Intractability 822
Chapter 6: A Computing Machine 873
6.1 Representing Information 874
6.2 TOY Machine 906
6.3 Machine-Language Programming 930
6.4 TOY Virtual Machine 958
Chapter 7: Building a Computing Device 985
7.1 Boolean Logic 986
7.2 Basic Circuit Model 1002
7.3 Combinational Circuits 1012
7.4 Sequential Circuits 1048
7.5 Digital Devices 1070
Context 1093
Glossary 1097
Index 1107
APIs 1139
· · · · · · (收起)
原文摘录
· · · · · ·
Shuffling an array. The following code shuffles the values in our deck of cards:
int n = deck.length;
for (int i = 0; i < n; i++)
{
int r = i + (int) (Math.random() * (n-i));
String temp = deck[i];
deck[i] = deck[r];
deck[r] = temp;
} (查看原文)
Before reading each number, the program uses the method StdIn.isEmpty() to check whether there are any more numbers in the input stream. How do we signal that we have no more data to type? By convention, we type a special sequence of characters known as the end-of-file sequence. Unfortunately, the terminal applications that we typically encounter on modern operating systems use different conventions for this critically important sequence. In this book, we use Ctrl-D... (查看原文)
![[美国] Robert Sedgewick](https://img3.doubanio.com/view/personage/m/public/d72509b2b86fcc8f2b89061cf5a3e3c7.jpg)
还没人写过短评呢