Joyji99的博客

Chap27 Balanced BSTs1 AVL Insertion2 AVL Delete3 Red-Black Insert4 Red-Black Delete1 AVL Insertion对于每个node，其子节点的高度最多差1，为balance先正常插入并记录每个node的高度，如果违法，则通过一次旋转，保持树的高度为lg(N)rotating leftsingle rotationsdouble rotation --> 如果不平衡是由右子树的左子树(或左子树

Chap26 Sorting1 O(N^2^) Sorts1.1 Bubble Sort1.2 Insertion Sort1.3 Selection Sort2 O(Nlg(N)) Sorts2.1 Heap Sort2.2 Merge Sort2.3 Quick Sort3 Sorting Tradeoffs4 Sorting Libraries1 O(N2) Sorts1.1 Bubble Sort遍历数组，将每个元素与其相邻的元素进行比较。如果两个元素的顺序不对，冒泡排序将交换它们。遍历数组

Chap25 Graphs1 Graph Applications1.1 Task Scheduling1.2 Resource Allocation1.3 Path Planning1.4 Social Networks2 Graph Implementations2.1 Adjacency Matrix2.2 Adjacency List2.3 Efficiency3 Graph Searches3.1 Depth-First Search: Recursively3.2 Depth-First Sea

Chap24 Heaps and Priority Queues1 Heap Concepts- 堆是一棵complete binary tree，遵循堆排序规则。完整二叉树是指除最后一层外的每一层都有尽可能多的节点，最后一层是从左到右填充的树1.1 Insertion1.2 Deletion2 Heap Array Implementation3 STL Priority Queue4 Priority Queues Use: Compression 压缩priority queue is queue

Chap23 Hash Tables1 Hash Table Basics2 Collision Resolution2.1 Chaining2.2 Open Addressing3 Hashing Functions3.1 A Bad Hash Function for Strings3.2 A Better Hash Function for Strings3.3 Cryptographic Hash Functions 加密哈希函数3.4 Hash Function Objects4 Rehashin

Chap22 Binary Search Trees 二叉查找树1 Binary Search Trees Concepts1.1 Terminology1.2 Uses2 Adding to a Binary Search Tree2.1 Recursion2.2 Find the Parent of the Node to Add2.3 Pointer to a Pointer to a Node3 Searching a Binary Tree4 Removing From a Binary Sear

Chap21 Linked Lists1 Linked List Basic Operations1.1 Add to Front1.2 Add to Back1.3 Searching1.4 Copying1.5 Destruction2 Insert in Sorted Order2.1 Pointer to Node Before2.2 Recursion2.3 Pointer to a Pointer3 Removing from a List3.1 Remove from Front or Bac

Chap20 Introduction To Algorithms and Data Structures1 Big-Oh Notation1.1 Definition1.2 Practical Big Ohs for Algorithms1.3 Typical 典型, Worst 最差, or Amortized 平摊1.4 Space1.5 Limitations2 Abstract Data Types3 Queues 队列3.1 ADT Definition3.2 An Array or Vecto

Chap19 Error Handling and Exceptions1 C-Style Error Handling2 C++-style: Exceptions3 Executing Code with Exceptions4 Exceptions as Part of a Function’s Interface5 Exception Corner Cases6 Using Exceptions Properly7 Exception Safety7.1 Resource Acquisition I

Chap18 Inheritance1 Another Conceptual Example2 Writing Classes with Inheritance3 Construction and Destruction4 Subtype Polymorphism5 Method Overriding6 Abstract Methods and Classes7 Inheritance and Templates7.1 Aspects That Are Composable7.2 Aspects That

Chap17 Templates1 Templated Functions1.1 Instantiating Templated Functions2 Templated Classes2.1 Templates as Template Parameters3 Template Rules3.1 Template Definitions Must Be “Visible” at Instantiations3.2 Template Arguments Must Be Compile-Time Constan

Chap16 Strings and IO Revisited1 Strings1.1 Cautionary Example 反例2 Output2.1 Return Type of Stream Insertion2.2 Writing Stream Insertion for Your Own Classes2.3 Object Orientation of This Approach2.4 Controlling Formatting3 Input3.1 Errors4 Other Streams4.

Chap15 Object Creation and Destruction1 Object Construction1.1 Overloading 重载1.2 Dynamic Allocation1.3 Types of Initialization1.4 Initializer Lists1.5 What to Do2 Object Destruction2.1 When Are Destructors Invoked3 Object Copying3.1 Copy Constructor3.2 Ass

Chap14 Transition to C++1 Objected-Oriented Programming1.1 Access Control1.2 encapsulate封装1.3 const Methods1.4 Plain Old Data1.5 Static Members1.6 Classes Can Contain Other Types1.7 The Basics of Good OO Design2 References3 Namespaces 命名空间4 Function Overlo

放链接已按照这篇文章安装完毕，除了powerline部分，因为python没有升级zsh-syntax-highlighting已安装经常要source，否则修改完zshrc不起作用source ~/.zshrc