洞察与创新：Bentley编程珠玑第二版探索

需积分: 10 95 浏览量更新于2024-07-24 收藏 1.24MB PDF 举报

"《编程珠玑》(Programming Pearls, Second Edition)是Jon Bentley所著的一本经典计算机科学著作，由Addison-Wesley出版社于2000年出版。该书的ISBN号码是0-201-65788-0，定价为$24.95。这本书以独特的视角探讨了软件开发中的艺术与洞察力，特别是那些源自深刻理解与创新的编程技巧，被业界誉为编程设计的艺术指南。《编程珠玑》并非传统的技术手册，而是通过一系列小案例研究、实际示例和引人入胜的练习，引导读者学习如何设计和创作高质量的程序，以及如何更深入地思考编程问题。它强调了设计在小型程序中的重要性，旨在提升程序员的创造力和技术素养。书中包含五个主要部分，涵盖了初步概念（Preliminaries）和性能优化（Performance）。在"Cracking the Oyster"栏目中，读者可以学习如何从复杂问题中提炼出简洁而优雅的解决方案；"Aha! Algorithms [Sketch]"则展示了算法设计的创新思维过程；"Writing Correct Programs [Sketch]"聚焦于编写无误代码的策略；而"ASmall Matter of Programming [Sketch]"则深入探讨编程实践中的细微之处。对于教学用途，网站提供了适合课堂使用的部分材料链接，让教师可以灵活运用这些资源进行教学。 Steve McConnell高度评价这本书，称其为“对小型设计的精彩颂扬”。访问网站，你可以亲自浏览样例，了解书中精华内容，并发现更新内容。此外，"The Back of the Envelope"栏目可能探讨的是如何快速估算算法效率和内存需求，这对于优化程序性能非常实用。整体而言，《编程珠玑》是一本不仅适合初学者拓宽视野，也适合经验丰富的程序员提升技能的宝贵参考资料，是对编程艺术的深度挖掘和实践分享。"From The Book"和"Table of Contents"提供了详细的章节划分和目录，帮助读者更好地导航和学习。"Preface"部分通常会介绍作者的目的、写作背景和读者群体，为阅读提供了上下文。"Co"可能是"Contents"（目录）的缩写，继续揭示了更多章节主题。"Column7"可能涉及的是一个独立的专题或讨论区，关注程序性能的特定方面。《编程珠玑》是一本兼具理论深度和实践指导价值的书籍，它将编程视为一门值得探索的艺术，鼓励读者在实践中不断提升自己的编程技艺。"编程珠玑"这个名字本身就象征着那些闪耀的编程技巧，值得每一个对编程充满热情的人去发掘和珍藏。"

Word Frequencies

(Illustrating Section 15.1 of

Programming Pearls)

Section 15.1 describes word frequencies and gives an example. Here are

some more examples, generated

by this program from the King James

Bible (789,616 words), the Iliad (153,210 words), and Programming Pearls

(79,525 words). This table shows the 40 most common words, and their

percentage in the document.

BIBLE % ILIAD % PEARLS %

the 7.86 the 6.25 the 5.64

and 4.88 and 4.23 of 2.76

of 4.35 of 3.64 a 2.43

to 1.69 to 2.15 to 2.18

And 1.61 his 1.62 and 2.01

that 1.57 he 1.60 in 1.96

in 1.54 in 1.42 is 1.36

shall 1.24 a 1.17 that 1.20

he 1.20 with 1.04 The 0.91

unto 1.13 that 0.94 for 0.83

I 1.10 you 0.91 by 0.67

his 1.06 for 0.89 it 0.57

a 1.01 him 0.84 this 0.56

for 0.90 I 0.83 with 0.51

they 0.87 as 0.79 an 0.50

be 0.84 was 0.77 program 0.48

is 0.84 they 0.66 on 0.48

with 0.75 on 0.64 be 0.47

not 0.74 from 0.64 are 0.47

all 0.66 but 0.58 as 0.45

thou 0.59 son 0.58 we 0.43

thy 0.56 had 0.58 at 0.39

was 0.56 not 0.56 can 0.39

it 0.56 their 0.56 time 0.38

which 0.54 it 0.56 I 0.36

my 0.52 is 0.50 was 0.35

LORD 0.50 will 0.49 you 0.33

their 0.49 have 0.48 code 0.33

have 0.48 all 0.47 from 0.28

will 0.47 by 0.47 or 0.26

from 0.45 them 0.46 its 0.26

ye 0.45 were 0.43 one 0.25

them 0.44 at 0.43 This 0.25

as 0.41 who 0.42 array 0.25

him 0.40 my 0.40 have 0.25

are 0.36 so 0.40 two 0.25

upon 0.34 your 0.38 each 0.25

were 0.34 when 0.37 first 0.24

by 0.32 be 0.36 search 0.24

when 0.31 upon 0.35 function 0.23

Phrases

(Section 15.2 of

Programming Pearls)

Words are the basic component of documents, and many

important problems can be solved by searching for words.

Sometimes, however, I search long strings (my documents, or

help files, or web pages, or even the entire web) for phrases,

such as ``substring searching'' or ``implicit data structures''.

How would you search through a large body of text to find ``a

phrase of several words''? If you had never seen the body of text

before, you would have no choice but to start at the beginning

and scan through the whole input; most algorithms texts

describe many approaches to this ``substring searching problem''.

Suppose, though, that you had a chance to preprocess the body of text before performing searches. You could make

a hash table (or search tree) to index every distinct word of the document, and store a list of every occurrence of

each word. Such an ``inverted index'' allows a program to look up a given word quickly. One can look up phrases

by intersecting the lists of the words they contain, but this is subtle to implement and potentially slow. (Some web

search engines do, however, take exactly this approach.)

We'll turn now to a powerful data structure and apply it to a small problem: given an input file of text, find the

longest duplicated substring of characters in it. For instance, the longest repeated string in ``Ask not what your

country can do for you, but what you can do for your country'' is `` can do for you'', with `` your country'' a close

second place. How would you write a program to solve this problem?

[Click for more examples of long repeated strings]

This problem is reminiscent of the anagram problem that we saw in Section 2.4. If the input string is stored in

c[0..n-1], then we could start by comparing every pair of substrings using pseudocode like this

maxlen = -1

for i = [0, n)

for j = (i, n)

if (thislen = comlen(&c[i], &c[j])) > maxlen

maxlen = thislen

maxi = i

maxj = j

The comlen function returns the length that its two parameter strings have in common, starting with their first

characters:

int comlen(char *p, char *q)

剩余282页未读，继续阅读

CharlieLi918

粉丝: 0
资源: 2

洞察与创新：Bentley编程珠玑第二版探索

Bentley系统解决方案.pdf

Bentley软件介绍.doc

[计算机科学经典著作].Programming.Pearls

Perl语言编程.pdf

macOS_Sequoia_15.1.password(imacos.top).rdr.split.016

【java毕业设计】小区物业管理系统（springboot+vue+mysql+说明文档）.zip

里面全部都是浪漫的爱心特效，有html和python编写的，大概几十种，欢迎下载，收藏

Delphi 12 控件之FUPX-32bit-PORTABLE.zip

HandyControl

macOS_Sequoia_15.1.password(imacos.top).rdr.split.049

最新资源