|
m*****n 发帖数: 251 | 2 有志于这方面的可以早看看啊
• Box, Don. Essential .Net, Volume I: The Common Language Runtime.
Addison-Wesley Professional, 2003.
• Brooks, Fredrick. The Mythical Man-Month: Essays on Software
Engineering. Addison-Wesley Professional, 1995.
• Cormen, T.H., C.E. Leiserson, R.L. Reivert, and Cli
Stein, eds.
Introduction to Algorithms. McGraw-Hill, 1990.
• Howard, Michael, and David LeBlanc, eds. Writing Secure Code.
Microsoft Press, 2001.
• Maguire, Steve. Writing Solid Code: Micro |
|
z********i 发帖数: 5 | 3 Cormen, Leiserson, Rivest and Stein写的
我网上没找到电子版本的,
谁有么? |
|
a***r 发帖数: 146 | 4 总共255M, 都是编程的. 希望对大家有所帮助. 如果有您喜欢的书,或找了好久没找找
的,请发包子.
祝大家找工作顺利!
http://www.megaupload.com/?d=ADTP86IH
下面是书单:
@BOOK{AlexandrescuModernC++Design:01,
title = {Modern C++ Design: Generic Programming and Design Patterns
Applied},
publisher = {Addison Wesley},
year = {2001},
author = {Andrei Alexandrescu},
file = {:programming/AlexandrescuModernC++Design01.pdf:PDF},
owner = {Mitbbs}
}
@BOOK{ArulkumaranJavaJ2EEJobInterview05,
title = {Java/J2EE Job Interview Companion},
year = {2005},
a... 阅读全帖 |
|
g**********y 发帖数: 14569 | 5 对sorted set,logN找左右边界,然后把这个range的数取出来。
TreeSet的实现,你可以去读Java source code. 是通过TreeMap来实现的,API里写的:
“A Red-Black tree based NavigableMap implementation. The map is sorted according to the natural ordering of its keys, or by a Comparator provided at map creation time, depending on which constructor is used.
This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations. Algorithms are adaptations of those in Cormen, Leiserson, and Rivest's Introduction to... 阅读全帖 |
|
g*****i 发帖数: 2162 | 6 假设这个range里有K个entry,那复杂度是不是O(logN+k)?
的:
according to the natural ordering of its keys, or by a Comparator provided
at map creation time, depending on which constructor is used.
containsKey, get, put and remove operations. Algorithms are adaptations of
those in Cormen, Leiserson, and Rivest's Introduction to Algorithms. ” |
|
g**********y 发帖数: 14569 | 7 对sorted set,logN找左右边界,然后把这个range的数取出来。
TreeSet的实现,你可以去读Java source code. 是通过TreeMap来实现的,API里写的:
“A Red-Black tree based NavigableMap implementation. The map is sorted according to the natural ordering of its keys, or by a Comparator provided at map creation time, depending on which constructor is used.
This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations. Algorithms are adaptations of those in Cormen, Leiserson, and Rivest's Introduction to... 阅读全帖 |
|
g*****i 发帖数: 2162 | 8 假设这个range里有K个entry,那复杂度是不是O(logN+k)?
的:
according to the natural ordering of its keys, or by a Comparator provided
at map creation time, depending on which constructor is used.
containsKey, get, put and remove operations. Algorithms are adaptations of
those in Cormen, Leiserson, and Rivest's Introduction to Algorithms. ” |
|
c***b 发帖数: 19 | 9 Introduction to Algorithms, Erik Demaine, Charles Leiserson
前几天版有人提供在线视频
试了下好象有几个Lecture不完整
自己又搜了下
居然ItunesU 有免费download
效果不错,只是没字幕
不过声音很清楚,基本上不需要字幕
各位在ItunesU上还淘到什么好东西,请分享 |
|
b*******r 发帖数: 1130 | 10 Introduction to Algorithms, Third Edition by Cormen, Leiserson, Rivest, and
Stein,
McGraw Hill, 2009 ISBN 0262033844
本学期CS的一门算法课的教材,准备去旁听,向大家请教一下,多谢! |
|
y****9 发帖数: 252 | 11 coursera 两门大算法课正在进行时,一个侧重于算法分析 (无语言要求),一个侧重
于算法实践 (Java 提交作业)。
https://www.coursera.org/course/algo
https://www.coursera.org/course/algs4partI
其中后者的主讲人是《算法(第四版)》的作者 Sedgewick
对求职有没有帮助就不评论了,不要太功利嘛,学习无止境。
同样的,你要的经典算法书:
CLRS - Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms
(3rd edition)
DPV - Dasgupta, Papadimitriou, and Vazirani, Algorithms
KT - Kleinberg and Tardos, Algorithm Design
SW - Sedgewick and Wayne, Algorithms (4th edition) |
|
w*****e 发帖数: 721 | 12
Introduction to Algorithms
by Cormen, Leiserson, Rivest, Stein (CLRS) |
|
h******6 发帖数: 198 | 13 我有好多好多全新影印版的计算机书想转让.每本10元.
1.A Course in Probability and Statistics
Charles J. Stone
2. Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
3. An Introduction to Stochastic Processes
Edward P.C. Kao
4.Object-Oriented Systems Analysis and Design
Ronald J. Norman
5. Discrete Mathematical Structures
Bernard Kolman
Robert C. Busby
Sharon Ross
6. Fundamentals of Digital Signal Processing
Joyce Van de Vegte
7. Probability for Applications
Paul E. Pfei |
|
r**********y 发帖数: 2774 | 14 1) Design Patterns (by GoF)
2) Introduction to Algorithms (by Cormen, Leiserson, Rivest, Stein)
3) Operatiing Systmes, Design and Implementation (by Tanenbaum, Woodhull)
4) IA-32 Intel Architecture Software Developer's Manual Vol. 3, System
Programming Guide
5) Programming Application for Windows (by Richter)
6) Analysis Patterns (by Fowler)
7) Data Model Patterns, Conventions of Thought (by Hay)
9) J2EE development without EJB
10) Methods of Programming
11)Agile Software Development: Principles |
|
|
b*****n 发帖数: 2324 | 16 link? thanks!
发信人: DrumMania (嫑跑,兲), 信区: CS
标 题: Re: introduction to algorithms (转载)
发信站: BBS 未名空间站 (Fri Feb 23 01:03:52 2007), 转信
我觉得leiserson讲课讲得不错 |
|
l*******e 发帖数: 1485 | 17 【 以下文字转载自 Computation 讨论区 】
发信人: lionphone (It\'s good!), 信区: Computation
标 题: Algorithm 课程及教材选择疑问
发信站: BBS 未名空间站 (Mon Jan 26 08:05:32 2009)
有两门课,都是关于algorithm的
其一是本科/研究生共选课, 用的是ALGORITHM DESIGN (Goodrich)
其二是研究生课,用的是Introduction to Algorithms (Cormen, Leiserson)
Amazon用户评价第二本比第一本好些。
我是学电子专业的,很久以前学过一点C, 没学过java.除此之外没选过其他计算机系的
基础课程。不知道该选哪个好。
按说,本科的课(其一)或许要简单些,但是教材评价不好,而且似乎里面用的是java
. 而研究生的课(其二)或许更难,未必适合我的情况---非计算机专业。
牛牛们有何指导? |
|
h******6 发帖数: 198 | 18 【 以下文字转载自 Boston 讨论区 】
发信人: haoyun96 (我家小宝叫小宝), 信区: Boston
标 题: 经典概率统计,计算机教材(影印版) For sale
发信站: BBS 未名空间站 (Fri Dec 4 23:11:08 2009, 美东)
我有好多好多全新影印版的计算机书想转让.每本10元.
1.A Course in Probability and Statistics
Charles J. Stone
2. Introduction to Algorithms
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
3. An Introduction to Stochastic Processes
Edward P.C. Kao
4.Object-Oriented Systems Analysis and Design
Ronald J. Norman
5. Discrete Mathematical Structures
Bernard Kolma |
|
hb 发帖数: 89 | 19 Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford
(2001). Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill
著名的CLRS |
|
z********i 发帖数: 5 | 20 去名校cs系里面的课程表上看看吧,
一般都写的很详细.
名校用的教材应该比较经典吧:)
for example:
Text:
Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein
using the THIRD edition. |
|
C***U 发帖数: 2406 | 21 谢谢
我就把你说的当作一种建议
看完书吧东西写出来却是要话很多时间
主要后面的习题很多
要做很多时间才能做完
我看的是
Thomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
Clifford Stein
他们写的
主要是我们学校cs课程用的这本书
而且网上有免费下的 |
|
l*****g 发帖数: 149 | 22 或能下载的论坛。
Introduction to Algorithms
by Thomas H. Cormen,
Charles E. Leiserson,
Ronald L. Rivest
and Clifford Stein
包子酬谢! |
|
p*****c 发帖数: 155 | 23 1. Introduction to Algorithms : Charles E. Leiserson, Clifford Stein, Ronald
L. Rivest, Thomas H. Cormen
在BT上面只找到中文版的
2. Big Java by Cay Horstmann
谢谢
p*****[email protected] |
|
N***m 发帖数: 4460 | 24 Introduction to Algorithms
by:
Thomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
Clifford Stein
The MIT Press |
|
z***a 发帖数: 69 | 25 小弟最近要去redmond面试,recruiter的信里面列出了这么多书,我觉得这么多短时间
内肯定看不完啊,有哪位大哥能勾个重点?谢谢了!
目前我就只有intro to algorithm和Modern Operating Systems在看,别的都没看过啊
!而且我也只会java。C只会一点。不会C++。你们觉得象design pattern和thinking
in java之类的书是否更有用些呢?
Software development resources recommendations:
Box, Don. Essential.NET, Volume I: The Common Language Runtime. Addison-
Wesley Professional, 2003.
Brooks, Fredrick. The Mythical Man-Month: Essays on Software Engineering.
Addison-Wesley Professional, 1995.
Cormen, T.H., Leiserson, C.E., Reivert, |
|
|
|
w*s 发帖数: 7227 | 28 靠,到现在还没人回,谁解答一下。
这书big data里用得到吗?
我老上美图。 |
|
e*******o 发帖数: 4654 | 29 基本的东西90年以前早定型了。
2,3 版网上一搜,电子版就有了,随便比对一下就好了。
big data 跟这个算法,完全两个不同的方向。
big data 要是偏统计的话,element of statistical learning。
我买书都是0.01 的。好不容易买了个新书,再所有买的书中纸质,印刷质量最差的。
美帝没落真是体现在方方面面。 |
|
|
q****x 发帖数: 7404 | 31 有修订,比如遍历树的一个算法。看前言。
已经第三版了。网上有免费pdf。 |
|
|
|
|
s***i 发帖数: 503 | 35 1991版的一般用用也就够了。见到没讲的但是又流行的,到网上搜搜
就知道了。 |
|
h****r 发帖数: 258 | 36 2版比1版还是增加了很多内容。3比2相对就少了。
2的2手也就10刀。 |
|
h****r 发帖数: 258 | 37 Second this.
Got all ebooks in pdfs but still prefer reading in paper (better to eyes) |
|
|
l*******e 发帖数: 1485 | 39 有两门课,都是关于algorithm的
其一是本科/研究生共选课, 用的是ALGORITHM DESIGN (Goodrich)
其二是研究生课,用的是Introduction to Algorithms (Cormen, Leiserson)
Amazon用户评价第二本比第一本好些。
我是学电子专业的,很久以前学过一点C, 没学过java.除此之外没选过其他计算机系的
基础课程。不知道该选哪个好。
按说,本科的课(其一)或许要简单些,但是教材评价不好,而且似乎里面用的是java
. 而研究生的课(其二)或许更难,未必适合我的情况---非计算机专业。
牛牛们有何指导? |
|
l*******e 发帖数: 1485 | 40 有两门课,都是关于algorithm的
其一是本科/研究生共选课, 用的是ALGORITHM DESIGN (Goodrich)
其二是研究生课,用的是Introduction to Algorithms (Cormen, Leiserson)
Amazon用户评价第二本比第一本好些。
我是学电子专业的,很久以前学过一点C, 没学过java.除此之外没选过其他计算机系的
基础课程。不知道该选哪个好。
按说,本科的课(其一)或许要简单些,但是教材评价不好,而且似乎里面用的是java
. 而研究生的课(其二)或许更难,未必适合我的情况---非计算机专业。
牛牛们有何指导? |
|
b*****e 发帖数: 1193 | 41 Introduction to Algorithms (Cormen, Leiserson)
course is tough, saying, you will learn more form it. |
|
i*****f 发帖数: 578 | 42 这个是根据著名的stackoverflow讨论总结的最具影响力编程书籍。与大家分享。BTW,
其中的CLRS introduction to alg我认为很适合用python.
http://www.internetsecuritydb.com/2011/09/top-ten-most-influent
programming.html
"If you could go back in time and tell yourself to read a specific book
at the beginning of your career as a developer, which book would it be."
Since it was first posed back in 2008, this question has become the
second most popular question of all time on StackOverflow.
Here are the results:
Code Complete (2nd Edition)
By Steve... 阅读全帖 |
|