Data structure and algorithm foundation (Qingdao University-Wang Zhuo) 需要其他资源的可以在我博客主页找找，太多了，我懒得整理
课程搭配书籍 数据结构++C语言版++第2版严蔚敏/清华大学.pdf Link: https://pan.baidu.com/s/1W8dCbnV_d_gaY8Lnf-CWyg Extraction code: cw2m After copying this content, open the Baidu Netdisk mobile app, the operation is more convenient
已整理完成
Source link: Click to view bilibili data structure and algorithm basis (Qingdao University-Wang Zhuo)
第一周Week 01a-Introduction
Week 01 b-1.1 Data structure research content
Week 01 c-1.2 Basic concepts and terminology 1
Week 01d-1.2 Basic concepts and terminology 2
Week 01 e-1.3 Representation and realization of abstract data types
Week 01 f-1.4 Algorithm and Algorithm Analysis 1
Week 01 g-1.4 Algorithm and Algorithm Analysis 2
Week 01 h-1.4 Algorithm and Algorithm Analysis 3
Week 01 i-1.4 Algorithm and Algorithm Analysis 4
第二周Week 02 01–2.1 Definition and characteristics of linear tables
Week 02 02–2.2 Case Introduction
Week 02 03-2.3 Type definition of linear table
Week 02 04-2.4 The sequential representation and realization of linear tables 1
Week 02 05-2.4 The sequential representation and realization of linear tables 2
Week 02 06 – Supplement 1 about operations related to C-like languages
Week 02 07 – Supplement 2 about operations related to C-like languages
Week 02 08-2.4 The sequential representation and realization of linear tables 3
Week 02 09-2.4 Sequence Representation and Implementation of Linear Table 4-Search Algorithm
Week 02 10-2.4 Sequence Representation and Implementation of Linear Table 5- Insertion Algorithm
Week 02 11-2.4 Sequence Representation and Implementation of Linear Table 6-Deletion Algorithm
Week 02 12-Summary of Sequence Table
第三周Week 3 01–2.5 Chained representation and realization of linear tables 1–Linked list concept
Week 3 02–2.5 Chained representation and realization of linear tables 2–Definition of singly linked tables
Week 3 03-2.5 Chained Representation and Implementation of Linear List 3—Basic Operation of Single Linked List 1-Initialize and Determine Empty List
Week 3 04–2.5 Chained Representation and Implementation of Linear List 4–Basic Operation of Singly Linked List 2–Destroy Singly Linked List
Week 3 05–2.5 Chained representation and realization of linear tables 5–Basic operations of singly linked lists 3–Clear singly linked lists
Week 3 06–2.5 Chained representation and realization of linear tables 6–Basic operations of singly linked lists 4–Find the table length of singly linked lists
Week 3 07-2.5 Chained representation and realization of linear lists 7-Basic operations of singly linked lists 5-Take the value of the i-th element
Week 3 08–2.5 Chained representation and realization of linear tables 8–Basic operations of singly linked tables 6–Search by value
Week 3 09-2.5 Chained Representation and Implementation of Linear List 9-Basic Operation of Single Linked List 7- Insert Node
Week 3 10-2.5 Chained Representation and Implementation of Linear List 10-Basic Operation of Single Linked List 8-Delete Node
Week 3 11–2.5 Chained Representation and Implementation of Linear List 11–Basic Operation of Single Linked List 9–Analysis of Find, Insert, Delete Algorithm
Week 3 12–2.5 Chained representation and realization of linear tables 12–Basic operations of singly linked lists 10–Head inserting method to establish a linked list
Week 3 13–2.5 Chained representation and realization of linear tables 13–Basic operations of singly linked lists 11–Create linked list by tail interpolation
第四周Week 04 01–2.5.3 Circular Linked List 1
Week 04 02-2.5.3 Circular Linked List 2-Two Linked Lists Merged
Week 04 03-2.5.4 Double Linked List 1
Week 04 04–2.5.4 Doubly Linked List 2 – Insertion of Doubly Linked List
Week 04 05–2.5.4 Doubly Linked List 3–Delete Operation of Doubly Linked List
Week 04 06 – Comparison of singly linked lists, circular linked lists, and doubly linked lists
Week 04 07-2.6 Comparison of Sequence List and Linked List
Week 04 08–2.7 Application of Linear Table 1 – Combination of Linear Table
Week 04 09–2.7 Application of Linear Table 2 – Consolidation of Ordered Tables – Realized by Order Table
Week 04 10-2.7 Application of Linear Table 3-Combination of Ordered Lists-Realized by Linked List
Week 04 11–2.8 Case Analysis and Implementation 1–Polynomial Operation
Week 04 12–2.8 Case Analysis and Implementation 2–Sparse Polynomial Operation
Week 04 13–2.8 Case Analysis and Implementation 3–Book Information Management
第五周Week 05 01-3.1 Definition and Features of Stacks and Queues 1-Introduction to Stacks and Queues
Week 05 02–3.1 Definition and characteristics of stacks and queues 2–3.1.1 Definition and characteristics of stacks
Week 05 03–3.1 Definition and characteristics of stacks and queues 1–3.1.2 Definition and characteristics of queues
Week 05 04–3.2 Case Introduction
Week 05 05–3.3 Representation and Implementation of the Stack 1–3.3.1 Abstract Data Type Definition of the Stack
Week 05 06–3.3 Stack Representation and Implementation 2–3.3.2 Stack Sequence Representation and Implementation 1–Stack Sequence Representation
Week 05 07–3.3 Stack Representation and Implementation 3–3.3.2 Stack Sequence Representation and Implementation 2–Sequential Stack Operation 1
Week 05 08–3.3 Stack Representation and Implementation 4–3.3.2 Stack Sequence Representation and Implementation 3–Sequential Stack Operation 2
Week 05 09–3.3 Stack Representation and Implementation 5–3.3.2 Stack Sequence Representation and Implementation 4–Sequential Stack Operation 3
Week 05 10-3.3 Stack Representation and Implementation 6-3.3.3 Chain Stack Representation and Implementation
Week 05 11-3.4 Stack and Recursion
Week 05 12–3.5 Queue Representation and Implementation 1–3.5.1 Queue Type Definition
Week 05 13-3.5 Representation and realization of queue 2—3.5.2 Sequence representation and realization of queue 1
Week 05 14–3.5 Representation and Implementation of Queue 3–3.5.2 Sequence Representation and Implementation of Queue 2
Week 05 15-3.5 Representation and Implementation of Queue 4-3.5.3 Chain Representation and Implementation of Queue
第六周Week 06 01-Chapter 4 Strings, Arrays and Generalized Tables 1-4.1 String Definition
Week 06 02-Chapter 4 Strings, Arrays and Generalized Tables 2-4.2 Introduction of Cases
Week 06 03-Chapter 4 Strings, Arrays and Generalized Tables 3-4.3 Type Definition and Storage Structure of Strings
Week 06 04-Chapter 4 Strings, Arrays and Generalized Tables 4-4.3 String Operations-String Matching Algorithm 1-BF Algorithm
Week 06 05-Chapter 4 Strings, Arrays and Generalized Tables 5-4.3 String Operations-String Matching Algorithm 2-KMP Algorithm
Week 06 06-Chapter 4 Strings, Arrays and Generalized Tables 6-4.4 Array 1-Array Definition and Characteristics
Week 06 07-Chapter 4 Strings, Arrays and Generalized Tables 7-4.4 Arrays 2-Abstract Type Definition of Arrays
Week 06 08-Chapter 4 Strings, Arrays and Generalized Tables 8-4.4 Arrays 3-Sequential Storage of Arrays
Week 06 09-Chapter 4 Strings, Arrays and Generalized Tables 9-4.4 Arrays 4-Symmetric Matrix Compressed Storage
Week 06 10-Chapter 4 Strings, Arrays, and Generalized Tables 10-4.4 Arrays 5--Triangular Matrix, Diagonal Matrix Compressed Storage
Week 06 11 – Chapter 4 Strings, Arrays, and Generalized Tables 11-4.4 Array 6 – Sparse Matrix Compressed Storage
Week 06 12-Chapter 4 Strings, Arrays and Generalized Tables 12-4.5 Generalized Tables
Week 06 13-Chapter 4 Strings, Arrays and Generalized Tables 13-4.6 Case Analysis and Implementation
第七周Week 07 01-5.1 Definition of Trees and Binary Trees 1-5.1.1 Definition of Trees
Week 07 02-5.1 Definitions of Trees and Binary Trees 2-5.1.2 Basic Terms of Trees
Week 07 03-5.1 Definition of Tree and Binary Tree 3-5.1.3 Definition of Binary Tree
Week 07 04-5.2 Case Introduction
Week 07 05–5.3 Abstract Data Type Definitions for Trees and Binary Trees
Week 07 06-5.4 The nature and storage structure of the binary tree 1-The nature of the binary tree 1, 2, 3
Week 07 07-5.4 The nature and storage structure of binary trees 2-Full binary trees and complete binary trees
Week 07 08-5.4 The nature and storage structure of the binary tree 3-The nature of the binary tree 4, 5
Week 07 09-5.4 The nature and storage structure of binary trees 4-The storage structure of binary trees 1-Sequential storage structure
Week 07 10-5.4 The nature and storage structure of the binary tree 4—The storage structure of the binary tree 2-chain storage structure
Week 07 11–5.5 Traversing Binary Trees and Cue Binary Trees 1 – Traversing Binary Trees
Week 07 12–5.5 Traversing Binary Trees and Cue Binary Trees 2 – Determine Binary Trees by Traversing Sequence
第八周Week 08 01–5.5 Traversing Binary Trees and Cue Binary Trees 3 – Preorder Recursive Traversal Algorithm of Binary Trees
Week 08 02–5.5 Traversing Binary Trees and Cue Binary Trees 4–Recursive Traversal Algorithm and Analysis of Binary Trees
Week 08 03–5.5 Traversing Binary Trees and Cue Binary Trees 5–Binary Tree Traversal Algorithm – In-Order Non-recursive Algorithm
Week 08 04-5.5 Traversing Binary Trees and Cue Binary Trees 6-Binary Tree Traversal Algorithm-Hierarchical Traversal Algorithm
Week 08 05-5.5 Traversing Binary Trees and Cue Binary Trees 7-Binary Tree Traversal Algorithm Application 1-Building Binary Tree Algorithm
Week 08 06–5.5 Traversing Binary Trees and Cue Binary Trees 8–Binary Tree Traversal Algorithm Application 2–Copy, Find the Number of Nodes, Find the Number of Leaf Nodes
Week 08 07–5.5 Traversing Binary Trees and Cue Binary Trees 9 – Cue Binary Trees
Week 08 08-5.6 Trees and Forests 1-Storage Structure of Trees 1-Parental Notation
Week 08 09-5.6 Trees and Forests 2-Tree Storage Structure 2-Child Linked List
Week 08 10-5.6 Trees and Forests 3-Storage Structure of Trees 3-Child Brother Notation
Week 08 11-5.6 Trees and Forests 4-Tree and Binary Tree Conversion
Week 08 12-5.6 Trees and Forests 5-Conversion of Forests and Binary Trees
Week 08 13-5.6 Trees and Forests 6-Traversal of Trees and Forests
第九周Week 09 01–5.7 Huffman Tree and Its Application 1-Introduction
Week 09 02–5.7 Huffman Tree and Its Application 2-5.7.1 Basic Concepts of Huffman Tree
Week 09 03-5.7 Huffman tree and its application 3-5.7.2 Huffman tree construction algorithm 1
Week 09 04-5.7 Huffman tree and its application 4-5.7.2 Huffman tree construction algorithm 2-Huffman tree algorithm implementation
Week 09 05-5.7 Huffman tree and its application 5-5.7.3 Huffman coding 1-Huffman coding idea
Week 09 06-5.7 Huffman Tree and Its Application 6-5.7.3 Huffman Coding 2-Huffman Coding Algorithm Implementation
Week 09 07-5.7 Huffman Tree and Its Application 7-5.7.3 Huffman Coding 3-Document Encoding and Decoding
Week 09 08-6.1 Basic concepts and terminology of graphs 1
Week 09 09-6.1 Basic concepts and terminology of graphs 2
Week 09 10-6.2 Case Introduction
Week 09 11-6.3 Figure Type Definition
第十周Week 10 01-6.4 The storage structure of graphs 1-1 Adjacency matrix representation 1-Adjacency matrix of undirected graphs
Week 10 02-6.4 The storage structure of graphs 2-1 Adjacency matrix representation 2-Directed graphs and the adjacency matrix of the net
Week 10 The storage structure of the 03-6.4 graph 3-2 Use the adjacency matrix notation to create an undirected network
Week 10 04-6.4 The storage structure of graphs 4-3 Advantages and disadvantages of adjacency matrix notation
Week 10 05-6.4 The storage structure of graphs 5-6.4.2 Adjacency list representation 1-Adjacency list of undirected graphs
Week 10 06-6.4 The storage structure of graphs 6-6.4.2 Adjacency list representation 2-Adjacency list of directed graphs
Week 10 07-6.4 The storage structure of graphs 7-6.4.2 Adjacency table notation 3-Algorithm for establishing adjacency list
Week 10 08-6.4 The storage structure of graphs 8-6.4.2 Adjacency list representation 4-Adjacent list representation advantages and disadvantages and the relationship with the adjacency matrix
Week 10 The storage structure of graphs 09-6.4 9-6.4.3 Cross-linked list
Week 10 10-6.4 Storage structure of graphs 10-6.4.4 Adjacent multiple tables
Week 10 11-6.5 traversal of graphs 1-depth-first search traversal ideas
Week 10 12-6.5 Graph traversal 2-Depth first search traversal implementation-traversal algorithm on adjacency matrix
Week 10 13-6.5 Graph traversal 3-Depth first search traversal implementation-traversal algorithm and algorithm analysis on adjacency list
Week 10 14-6.5 Graph traversal 4-Breadth first search traversal and its implementation
第十一周Week 11 01–6.6 Application of graph 1–6.6.1 Minimum spanning tree 1 – Spanning tree and its construction
Week 11 02–6.6 Application of graph 2–6.6.1 Minimum spanning tree 2–Minimum spanning tree and its typical applications
Week 11 Application of the 03–6.6 Graph 3–6.6.1 Minimum Spanning Tree 3–MST Properties
Week 11 04–6.6 Application of graph 4–6.6.1 Minimum spanning tree 4–Construction of minimum spanning tree 1–Prim algorithm
Week 11 05–6.6 Application of graph 5–6.6.1 Minimum spanning tree 5–Construction of minimum spanning tree 2–Kruskal algorithm
Week 11 06–6.6 Application of graph 6–6.6.2 Shortest path 1 – Shortest path problem abstraction
Week 11 07–6.6 Graph Application 7–6.6.2 Shortest Path 2–Dijkstra Algorithm
Week 11 08–6.6 Graph Application 8–6.6.2 Shortest Path 3–Floyd Algorithm
Week 11 09-6.6 Application of graph 9-6.6.3 Topological sorting
Week 11 10-6.6 Application of Diagram 10-6.6.4 Critical Path 1—Use AOE Net to Express Project Plan
Week 11 11–6.6 Application of graph 11–6.6.4 Critical path 2—Solving the critical path
第十二周Week 12 01–Chapter 7 Search 1–7.1 Basic Concepts of Search
Week 12 02–Chapter 7 Search 2–7.2 Finding a Linear Table 1–7.2.1 Sequential Search 1–Sequential Search Algorithm
Week 12 03–Chapter 7 Search 3–7.2 Search for Linear Table 2–7.2.1 Sequential Search 2–Sequential Search Algorithm Analysis
Week 12 04–Chapter 7 Search 4–7.2 Finding a Linear Table 3–7.2.2 Half Search 1 – Half Search Algorithm
Week 12 05–Chapter 7 Search 5–7.2 Search for Linear Tables 4–7.2.2 Half Search 2–Analysis of Half Search Algorithm
Week 12 06–Chapter 7 Search 6–7.2 Search for Linear Tables 5–7.2.3 Block Search 1 – Block Search Algorithm
Week 12 07–Chapter 7 Search 7–7.2 Linear Table Search 6–7.2.3 Block Search 2 – Block Search Algorithm Analysis and Comparison
Week 12 08-Chapter 7 Search 8-7.3 Lookup of Tree Table 1-7.3.1 Binary Sort Tree 1-Binary Sort Tree Definition
Week 12 09–Chapter 7 Search 9–7.3 Lookup of Tree Table 2–7.3.1 Binary Sort Tree 2–Binary Sort Tree Search – Recursive Algorithm
Week 12 10–Chapter 7 Search 10–7.3 Lookup of Tree Table 3–7.3.1 Binary Sort Tree 3–Analysis of Binary Sort Tree Search Algorithm
Week 12 11–Chapter 7 Search 11–7.3 Lookup of Tree Table 4–7.3.1 Binary Sort Tree 4–Insertion and Generation of Binary Sort Tree
Week 12 12–Chapter 7 Search 12–7.3 Lookup of Tree Table 5–7.3.1 Binary Sort Tree 5–Delete Binary Sort Tree
第十三周Week 13 1–7.3 Lookup of the Tree Table 6–7.3.2 Balanced Binary Tree 1–Definition of Balanced Binary Tree
Week 13 2–7.3 Lookup of Tree Table 7–7.3.2 Balanced Binary Tree 2–Balance Adjustment Method 1
Week 13 3–7.3 Lookup of the tree table 8–7.3.2 Balanced binary tree 3–Balance adjustment method 2–Four types of adjustment
Week 13 4–7.3 Finding the Tree Table 9–7.3.2 Balanced Binary Tree 4–Balance Adjustment Method 3–Example Questions
Week 13 5–7.4 Finding the hash table 1–7.4.1 Basic concepts of the hash table
Week 13 6–7.4 Finding the hash table 2–7.4.2 Construction of the hash function
Week 13 7–7.4 Finding the hash table 3–7.4.3 Method of handling conflicts 1 – Open address method 1 – Linear detection method
Week 13 8-7.4 Finding the hash table 4-7.4.3 Conflict handling method 2- Open address method 2- Secondary detection method, pseudo-random detection method
Week 13 9–7.4 Finding the hash table 5–7.4.3 Method of handling conflicts 3–Chain address method
Week 13 10-7.4 Hash table search 6-7.4.4 Hash table search and performance analysis
第十四周Week 14 01–Chapter 8 Sorting 1–8.1 Overview of Sorting
Week 14 02-Chapter 8 Sort 2-8.2 Insertion Sort 1-Direct Insertion Sort
Week 14 03-Chapter 8 Sort 3-8.2 Insertion Sort 2-Half Insertion Sort
Week 14 04-Chapter 8 Sorting 4-8.2 Insertion Sorting 3-Hill Sorting
Week 14 05-Chapter 8 Sorting 5-8.3 Exchange Sorting 1-Bubble Sorting
Week 14 06-Chapter 8 Sort 6-8.3 Exchange Sort 2-Quick Sort 1
Week 14 07-Chapter 8 Sort 7-8.3 Exchange Sort 3-Quick Sort 2-Quick Sort Algorithm Analysis
Week 14 08-Chapter 8 Sort 8-8.4 Selection Sort 1-Simple Selection Sort
Week 14 09-Chapter 8 Sort 9-8.4 Selection Sort 2-Heap Sort 1
Week 14 10 – Chapter 8 Sort 10 – 8.4 Select Sort 3 – Heap Sort 2 – Heap Adjustment
Week 14 11-Chapter 8 Sort 11-8.4 Select Sort 4-Heap Sort 3-Build Heap
Week 14 12-Chapter 8 Sorting 12-8.4 Selection Sort 5-Heap Sort 4-Heap Sort Algorithm and Analysis
Week 14 13–Chapter 8 Sort 13–8.5 Merge Sort
Week 14 14–Chapter 8 Sort 14–8.6 Radix Sort
Week 14 15-Chapter 8 Sort 15-Comparison of various sorting methods