SpringBoot实战(第4版)带书签高清版本-文字可复制，这个是非扫描的带书签版本，可以复制文字。

Introduction to Algorithms Third Editio Contents I Foundations Introduction 3 1 The Role of Algorithms in Computing 5 1.1 Algorithms 5 1.2 Algorithms as a technology 11 2 Getting Started 16 2.1 Insertion sort 16 2.2 Analyzing algorithms 23 2.3 Designing algorithms 29 3 Growth of Functions 43 3.1 Asymptotic notation 43 3.2 Standard notations and common functions 53 4 Divide-and-Conquer 65 4.1 The maximum-subarray problem 68 4.2 Strassen’s algorithm for matrix multiplication 75 4.3 The substitution method for solving recurrences 83 4.4 The recursion-tree method for solving recurrences 88 4.5 The master method for solving recurrences 93 4.6 Proof of the master theorem 97 5 Probabilistic Analysis and Randomized Algorithms 114 5.1 The hiring problem 114 5.2 Indicator random variables 118 5.3 Randomized algorithms 122 5.4 Probabilistic analysis and further uses of indicator random variables 130 vi Contents II Sorting and Order Statistics Introduction 147 6Heapsort151 6.1 Heaps 151 6.2 Maintaining the heap property 154 6.3 Building a heap 156 6.4 The heapsort algorithm 159 6.5 Priority queues 162 7 Quicksort 170 7.1 Description of quicksort 170 7.2 Performance of quicksort 174 7.3 A randomized version of quicksort 179 7.4 Analysis of quicksort 180 8 Sorting in Linear Time 191 8.1 Lower bounds for sorting 191 8.2 Counting sort 194 8.3 Radix sort 197 8.4 Bucket sort 200 9 Medians and Order Statistics 213 9.1 Minimum and maximum 214 9.2 Selection in expected linear time 215 9.3 Selection in worst-case linear time 220 III Data Structures Introduction 229 10 Elementary Data Structures 232 10.1 Stacks and queues 232 10.2 Linked lists 236 10.3 Implementing pointers and objects 241 10.4 Representing rooted trees 246 11 Hash Tables 253 11.1 Direct-address tables 254 11.2 Hash tables 256 11.3 Hash functions 262 11.4 Open addressing 269 11.5 Perfect hashing 277 Contents vii 12 Binary Search Trees 286 12.1 What is a binary search tree? 286 12.2 Querying a binary search tree 289 12.3 Insertion and deletion 294 ? 12.4 Randomly built binary search trees 299 13 Red-Black Trees 308 13.1 Properties of red-black trees 308 13.2 Rotations 312 13.3 Insertion 315 13.4 Deletion 323 14 Augmenting Data Structures 339 14.1 Dynamic order statistics 339 14.2 How to augment a data structure 345 14.3 Interval trees 348 IV Advanced Design and Analysis Techniques Introduction 357 15 Dynamic Programming 359 15.1 Rod cutting 360 15.2 Matrix-chain multiplication 370 15.3 Elements of dynamic programming 378 15.4 Longest common subsequence 390 15.5 Optimal binary search trees 397 16 Greedy Algorithms 414 16.1 An activity-selection problem 415 16.2 Elements of the greedy strategy 423 16.3 Huffman codes 428 16.4 Matroids and greedy methods 437 16.5 A task-scheduling problem as a matroid 443 17 Amortized Analysis 451 17.1 Aggregate analysis 452 17.2 The accounting method 456 17.3 The potential method 459 17.4 Dynamic tables 463 viii Contents V Advanced Data Structures Introduction 481 18 B-Trees 484 18.1 Definition of B-trees 488 18.2 Basic operations on B-trees 491 18.3 Deleting a key from a B-tree 499 19 Fibonacci Heaps 505 19.1 Structure of Fibonacci heaps 507 19.2 Mergeable-heap operations 510 19.3 Decreasing a key and deleting a node 518 19.4 Bounding the maximum degree 523 20 van Emde Boas Trees 531 20.1 Preliminary approaches 532 20.2 A recursive structure 536 20.3 The van Emde Boas tree 545 21 Data Structures for Disjoint Sets 561 21.1 Disjoint-set operations 561 21.2 Linked-list representation of disjoint sets 564 21.3 Disjoint-set forests 568 21.4 Analysis of union by rank with path compression 573 VI Graph Algorithms Introduction 587 22 Elementary Graph Algorithms 589 22.1 Representations of graphs 589 22.2 Breadth-first search 594 22.3 Depth-first search 603 22.4 Topological sort 612 22.5 Strongly connected components 615 23 Minimum Spanning Trees 624 23.1 Growing a minimum spanning tree 625 23.2 The algorithms of Kruskal and Prim 631 Contents ix 24 Single-Source Shortest Paths 643 24.1 The Bellman-Ford algorithm 651 24.2 Single-source shortest paths in directed acyclic graphs 655 24.3 Dijkstra’s algorithm 658 24.4 Difference constraints and shortest paths 664 24.5 Proofs of shortest-paths properties 671 25 All-Pairs Shortest Paths 684 25.1 Shortest paths and matrix multiplication 686 25.2 The Floyd-Warshall algorithm 693 25.3 Johnson’s algorithm for sparse graphs 700 26 Maximum Flow 708 26.1 Flow networks 709 26.2 The Ford-Fulkerson method 714 26.3 Maximum bipartite matching 732 ? 26.4 Push-relabel algorithms 736 ? 26.5 The relabel-to-front algorithm 748 VII Selected Topics Introduction 769 27 Multithreaded Algorithms 772 27.1 The basics of dynamic multithreading 774 27.2 Multithreaded matrix multiplication 792 27.3 Multithreaded merge sort 797 28 Matrix Operations 813 28.1 Solving systems of linear equations 813 28.2 Inverting matrices 827 28.3 Symmetric positive-definite matrices and least-squares approximation 832 29 Linear Programming 843 29.1 Standard and slack forms 850 29.2 Formulating problems as linear programs 859 29.3 The simplex algorithm 864 29.4 Duality 879 29.5 The initial basic feasible solution 886 x Contents 30 Polynomials and the FFT 898 30.1 Representing polynomials 900 30.2 The DFT and FFT 906 30.3 Efficient FFT implementations 915 31 Number-Theoretic Algorithms 926 31.1 Elementary number-theoretic notions 927 31.2 Greatest common divisor 933 31.3 Modular arithmetic 939 31.4 Solving modular linear equations 946 31.5 The Chinese remainder theorem 950 31.6 Powers of an element 954 31.7 The RSA public-key cryptosystem 958 ? 31.8 Primality testing 965 ? 31.9 Integer factorization 975 32 String Matching 985 32.1 The naive string-matching algorithm 988 32.2 The Rabin-Karp algorithm 990 32.3 String matching with finite automata 995 ? 32.4 The Knuth-Morris-Pratt algorithm 1002 33 Computational Geometry 1014 33.1 Line-segment properties 1015 33.2 Determining whether any pair of segments intersects 1021 33.3 Finding the convex hull 1029 33.4 Finding the closest pair of points 1039 34 NP-Completeness 1048 34.1 Polynomial time 1053 34.2 Polynomial-time verification 1061 34.3 NP-completeness and reducibility 1067 34.4 NP-completeness proofs 1078 34.5 NP-complete problems 1086 35 Approximation Algorithms 1106 35.1 The vertex-cover problem 1108 35.2 The traveling-salesman problem 1111 35.3 The set-covering problem 1117 35.4 Randomization and linear programming 1123 35.5 The subset-sum problem 1128 Contents xi VIII Appendix: Mathematical Background Introduction 1143 A Summations 1145 A.1 Summation formulas and properties 1145 A.2 Bounding summations 1149 B Sets, Etc. 1158 B.1 Sets 1158 B.2 Relations 1163 B.3 Functions 1166 B.4 Graphs 1168 B.5 Trees 1173 C Counting and Probability 1183 C.1 Counting 1183 C.2 Probability 1189 C.3 Discrete random variables 1196 C.4 The geometric and binomial distributions 1201 ? C.5 The tails of the binomial distribution 1208 D Matrices 1217 D.1 Matrices and matrix operations 1217 D.2 Basic matrix properties 1222 Bibliography 1231 Index 1251

文字版，并非扫描版。 仅提供参看，若觉得有用请购买正版

本教程虽号称高速上手教程，但实际上对 C++11/14 的相关特性做了一个较为全面的介绍，读者可以自行根据下面的目录选取感兴趣的内容进行学习，快速熟悉需要了解的内容，这从某种意义上来说，也算是高速上手了。 这些特性并不需要全部掌握，只需针对特定的应用场景，学习、查阅最适合自己的新特性即可。 值得一提的是，本教程在介绍这些特性的过程中，尽可能简单明了的介绍了这些特性产生的历史背景和技术需求，这为理解这些特性、运用这些特性提供了很大的帮助。 封面 1 目录 2 高速上手 C++ 11/14 3 引言 3 目标读者 3 本书目的 4 内容一览 4 赞助 7 交流 7 致谢 8 版权声明 8 第一章 C++11/14 简介 9 一、被弃用的特性 9 二、与 的兼容性 9 进一步阅读的参考资料 11 第二章 语言可用性的强化 13 一、本节内容 13 二、 与 14 三、类型推导 17 四、区间迭代 20 五、初始化列表 20 六、模板增强 22 七、面向对象增强 27 八、强类型枚举 31 总结 32 进一步阅读的参考资料 33 第三章 语言运行期的强化 34 一、本节内容 34 二、 表达式 34 二、函数对象包装器 37 三、右值引用 40 总结 48 第四章 对标准库的扩充：新增容器 49 一、本节内容 49 二、 和 49 三、无序容器 50 四、元组 53 总结 56 第五章 对标准库的扩充：引用计数与智能指针 58 一、本节内容 58 二、 与引用计数 58 三、 59 四、 60 五、 62 总结 64 进一步阅读的参考资料 64 第六章 正则表达式库 66 一、本节内容 66 二、正则表达式简介 66 三、 及其相关 68 总结 70 进一步阅读的参考资料 71 第七章 语言级线程支持 72 一、本节内容 72 二、 72 三、 72 总结 77 进一步阅读的参考资料 77 第八章 其他杂项 78 一、本节内容 78 二、新类型 78 三、 的修饰和操作 78 四、字面量 81 总结 83 第九章 扩展主题： C++17 简介 84 一、本节内容 84 二、主要入选特性 84 三、未入选特性 87 总结 89 进一步阅读的参考资料 89

Linux环境编程：从应用到内核 Linux环境编程：从应用到内核 Linux环境编程：从应用到内核

An international edition is a textbook that has been published outside the U.S. International editions are often cheaper than the U.S. version. Customers located in the U.S. can now purchase international edition textbooks. However, the publishers of international editions generally do not authorize the sale and distribution of international editions in Canada, and such sale or distribution may violate the copyrights and trademarks of the publishers of such works. Electric Circuits, Tenth Edition, is designed for use in a one or two-semester Introductory Circuit Analysis or Circuit Theory Course taught in Electrical or Computer Engineering Departments. This title is also suitable for readers seeking an introduction to electric circuits. Electric Circuits is the most widely used introductory circuits textbook of the past 25 years. As this book has evolved to meet the changing learning styles of students, the underlying teaching approaches and philosophies remain unchanged. MasteringEngineering for Electric Circuits is a total learning package that is designed to improve results through personalized learning. This innovative online program emulates the instructor’s office–hour environment, guiding students through engineering concepts from Electric Circuits with self-paced individualized coaching. Teaching and Learning Experience This program will provide a better teaching and learning experience—for you and your students. Personalize Learning with Individualized Coaching: MasteringEngineering provides students with wrong-answer specific feedback and hints as they work through tutorial homework problems. Emphasize the Relationship between Conceptual Understanding and Problem Solving Approaches: Chapter Problems and Practical Perspectives illustrate how the generalized techniques presented in a first-year circuit analysis course relate to problems faced by practicing engineers. Build an Understanding of Concepts and Ideas Explicitly in Terms of Previous Learning: Assessment Problems and Fundamental Equations and Concepts help students focus on the key principles in electric circuits. Provide Students with a Strong Foundation of Engineering Practices: Computer tools, examples, and supplementary workbooks assist students in the learning process.

《经典原版书库：计算机网络（英文版·第5版）》是全球最具权威性和经典性的计算机网络教材，我国各高等院校也广泛采用此书作为计算机网络课程的基本教材。Tanenbaum教授以高深的理论造诣和丰富的实践经验，在书中对计算机网络的原理、结构、协议标准与应用等做了深入的分析与研究。 全书按照网络协议模型（物理层、数据链路层、介质访问控制子层、网络层、传输层和应用层）’自底向上逐层讲述每一层所用的技术与协议标准，并给出大量实例。全书内容全面翔实，体系清晰合理叙述由简入繁、层层深入，自底向上方法也符合人类从底层到高层的认识规律，因此是公认的最适合网络入门的教材。

GB18285-2018 汽油车污染物排放限值及测量方法（双怠速及简易工况法） 文字版，发布稿，清晰，体积小。

本书是Java语言的经典教材，多年来畅销不衰- 本书全面整合了Java 8的特性，采用 ‘‘基础优先，问 题驱动” 的教学方式，循序渐进地介绍了程序设计基础、解决问题的方法、面向对象程序设计、图形用户 界面设计、异常处理、I/O和递归等内容。此外，本书还全面且深入地覆盖了一些高级主题，包括算法和数 据结构、多线程、网络、国际化、高级GUI等内容。

高清非扫描版！ The C Programming Language译作《C程序设计语言》，是由著名的计算机科学家Brian W. Kernighan和C语言之父的Dennis M. Ritchie合著的一部计算机科学著作，是第一部介绍C语言编程方法的书籍。它是一本必读的程序设计语言方面的参考书。它在C语言的发展和普及过程中起到了非常重要的作用，被视为是C语言的业界标准规范，而且至今仍然广泛使用。它也被公认为计算机技术著作的典范，以清晰简洁的文字讲述而著称。书中用"hello world"为实例开始讲解程序设计，也已经成为程序设计语言图书的传统。