算法导论Introduction to Algorithms(CLRS)
来源:互联网 发布:冷心心 你敢知 编辑:程序博客网 时间:2024/04/29 04:38
算法导论
Introduction to Algorithms(CLRS)
学习和讨论网页
本书自第一版出版以来,已经成为世界范围内广泛使用的大学教材和专业人员的标准参考手册。本书全面论述了算法的内容,从一定深度上涵盖了算法的诸多方面,同时其讲授和分析方法又兼顾了各个层次读者的接受能力。各章内容自成体系,可作为独立单元学习。所有算法都用英文和伪码描述,使具备初步编程经验的人也可读懂。全书讲解通俗易懂,且不失深度和数学上的严谨性。
Topics covered: Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions).
请记住:算法导论 是本教材 而 TAOCP 是本史诗。
电子版下载
TAOCP 讨论网页
- 算法导论Introduction to Algorithms(CLRS)
- Introduction to Algorithms (算法导论) 学习笔记 -- Chapter 9
- 麻省理工学院《算法导论》(MIT - Introduction to Algorithms)
- Introduction to Algorithms算法导论笔记-Lecture1
- 算法导论(Introduction to Algorithms )— 第二章 算法入门 — 2.1 插入排序
- CLRS(Introduction to Algorithms 2nd) reading notes 1
- CLRS (Introduction to Algorithms 2nd) reanding notes 2
- CLRS (Introduction to Algorithms 2nd) reanding notes 3
- CLRS (Introduction to Algorithms 2nd) reanding notes 4
- CLRS (Introduction to Algorithms 2nd) reading notes 5
- 算法导论(Introduction to Algorithms )— 第十二章 二叉搜索树— 12.1 什么是二叉搜索树
- Introduction to Algorithms 算法导论 第2章 算法入门 学习笔记及习题解答
- 算法导论(Introduction to Algorithms)之算法入门(插入排序与合并排序C语言实现)
- 算法导论题解(我的答案,欢迎指正) introduction to algorithms
- Introduction to Algorithms 算法导论 第1章 基础知识 学习笔记及习题解答
- Introduction to Algorithms 算法导论 第3章 函数的增长 学习笔记及习题解答
- Introduction to Algorithms 算法导论 第4章 递归式 学习笔记及习题解答
- 算法导论(Introduction to Algorithms)之堆排序(C语言实现)
- 能力VS证书续--绝非鱼&熊掌
- Java Web Framework综述
- The Art of Computer Programming(TAOCP)
- AppFuse1.8中BaseAction的一些主要方法说明
- 从AppFuse1.7的BaseAction中看DispatchAction的具体使用
- 算法导论Introduction to Algorithms(CLRS)
- [NET]取得字串長度(可計算中英文不同長度)
- linux下配置本机ip地址
- C与C++的函数调用约定
- 如何调试包含共享库代码的程序
- LifeType的自订网址
- [分享]千万数量级分页存储过程(效果演示)
- 靈活運用 ASP.NET 內建 ViewState 功能改善網站執行效率
- C++设计新思维系列丛书