Algorithms

Algorithms pdf epub mobi txt 电子书 下载 2025

Sanjoy Dasgupta
图书标签:
想要找书就要到 静流书站
立刻按 ctrl+D收藏本页
你会得到大惊喜!!
0 Prologue 11
0.1 Books and algorithm
0.2 Enter Fibonacc
0.3 Big-O notatio15
Exercise
1 Algorithms with numbers 21
1.1 Basic arithmeti
1.2 Modular arithmeti
1.3 Primality testin
1.4 Cryptograph39
1.5 Universal hashin
Exercise . . 48
Randomized algorithms: a virtual chapter 39
2 Divide-and-conquer algorithms 55
2.1 Multiplicatio55
2.2 Recurrence relation
2.3 Mergesor0
2.4 Median
2.5 Matrix multiplicatio
2.6 The fast Fourier transfor
Exercise
3 Decompositions of graphs 91
3.1 Why graphs
3.2 Depth-first search in undirected graph
3.3 Depth-first search in directed graph
3.4 Strongly connected component
Exercise
4 Paths in graphs 115
4.1 Distance15
4.2 Breadth-first searc
4.3 Lengths on edge
4.4 Dijkstra’s algorith
4.5 Priority queue implementation
4.6 Shortest paths in the presence of negative edge
4.7 Shortest paths in dag
Exercise
5 Greedy algorithms 139
5.1 Minimum spanning tree
5.2 Huffman encodin
5.3 Horn formula
5.4 Set cover
Exercise
6 Dynamic programming 169
6.1 Shortest paths in dags, revisite
6.2 Longest increasing subsequence
6.3 Edit distanc
6.4 Knapsac
6.5 Chain matrix multiplicatio
6.6 Shortest path
6.7 Independent sets in tree
Exercise
7 Linear programming and reductions 201
7.1 An introduction to linear programmin
7.2 Flows in network
7.3 Bipartite matchin
7.4 Dualit
7.5 Zero-sum game
7.6 The simplex algorith
7.7 Postscript: circuit evaluatio
Exercise
8 NP-complete problems 247
8.1 Search problem
8.2 NP-complete problem
8.3 The reduction262 Exercise
9 Coping with NP-completeness 283
9.1 Intelligent exhaustive searc
9.2 Approximation algorithm
9.3 Local search heuristic
Exercise
10 Quantum algorithms 311
10.1 Qubits, superposition, and measuremen
10.2 The plan
10.3 The quantum Fourier transfor
10.4 Periodicit
10.5 Quantum circuit
10.6 Factoring as periodicit
10.7 The quantum algorithm for factorin
Exercise
Historical notes and further reading 331
· · · · · · (收起)

具体描述

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal.

用户评价

评分

评分

##终于读完了。因为TA一本基础算法课的原因,得经常翻这本书的一些章节(这本书是教材),觉得很不错,在TA完了以后,希望可以系统得看完,只能用零散的时间,所以看了很久。讲到对它的评价,假设我这3年算法能力没有什么重大提高的话,这本书在对算法的分析和主线的总结上,非常明显的好于《算法导论》。

评分

评分

##很好,建议先看这本

评分

##终于读完了。因为TA一本基础算法课的原因,得经常翻这本书的一些章节(这本书是教材),觉得很不错,在TA完了以后,希望可以系统得看完,只能用零散的时间,所以看了很久。讲到对它的评价,假设我这3年算法能力没有什么重大提高的话,这本书在对算法的分析和主线的总结上,非常明显的好于《算法导论》。

评分

评分

##伯克利的教材,很通俗易懂~

评分

评分

##比较有感的就是快速傅里叶变换的算法,的确有点碉堡……

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou 等,本站所有链接都为正版商品购买链接。

© 2025 windowsfront.com All Rights Reserved. 静流书站 版权所有