Next Value Calculation Idea of Pattern Strings在线视频

Data Structures and Algorithms课程列表：

1. Introduction

-1.1 Basic Concepts in Data Structures

--Basic Concepts in Data Structures

-1.2 Basic Concepts in Data Structures

--Basic Concepts in Data Structures

-1.3 Basic Concepts in Data Structures

--Basic Concepts in Data Structures

-1.4 Logical Structure and Storage Structure of Data

--Logical Structure and Storage Structure of Data

-1.5 Algorithms and Time Complexity

--Algorithms and Time Complexity

-test1

2. Linear Lists

-2.1 Linear List and Sequential Storage

--Linear List and Sequential Storage

-2.2 Singly Linked Lists

--Singly Linked Lists

-2.3 Create a Singly Linked List

--Create a Singly Linked List

-2.4 Circularly Linked List

--Circularly Linked List

-2.5 Single-Variable Polynomials

--Single-Variable Polynomials

-test2

3. Stacks and Queues

-3.1 Stack Concepts and Applications

--Stack Concepts and Applications

-3.2 Applications of Stacks

--Applications of Stacks

-3.3 Concept and Application of Queues

--Concept and Application of Queues

-3.4 Expression Evaluation

--Expression Evaluation

-3.5 Recursion and Devide and Conquer

--Recursion and Devide and Conquer

-test3

4. String

-4.1 Basic Operation of Strings

--Basic Operation of Strings

-4.2 Pattern Matching of Strings

--Pattern Matching of Strings

-4.3 KMP Pattern Matching Algorithm for Strings

--KMP Pattern Matching Algorithm for Strings

-4.4 Next Value Calculation Idea of Pattern Strings

--Next Value Calculation Idea of Pattern Strings

-test4

5. Multidimensional array

-5.1 Definition of Array and Sequential Storage

--Definition of Array and Sequential Storage

-5.2 Compressed Storage Schemes for Special Matrices

--Compressed Storage Schemes for Special Matrices

-5.3 Fast Inversion of Triple Sequence Table

--Fast Inversion of Triple Sequence Table

-test5

6. Trees

-6.1 Properties of Binary Trees

--Properties of Binary Trees

-6.2 Binary Tree Traversals

--Binary Tree Traversals

-6.3 Application of Binary Trees

--Application of Binary Trees

-6.4 Non-recursive Traversal of Binary Trees

--Non-recursive Traversal of Binary Trees

-6.5 Trees and Forest

--Trees and Forest

-6.6 Huffman Tree

--Huffman Tree

-6.7 Huffman Coding

--Huffman Coding

-test6

7. Graphs

-7.1 Basic Concepts of Graphs

--Basic Concepts of Graphs

-7.2 The Storage Structure of Graphs

--The Storage Structure of Graphs

-7.3 The Depth-First Search of Graphs

--The Depth-First Search of Graphs

-7.4 The Breadth-First Search of Graphs

--The Breadth-First Search of Graphs

-7.5 The Minimum Spanning Tree of Graphs ——The Idea Based On Prim Algorithm

--The Minimum Spanning Tree of Graphs ——The Idea Based On Prim Algorithm

-7.6 The Minimum Spanning Tree of Graphs ——Implementation of Prim Algorithm

--The Minimum Spanning Tree of Graphs ——Implementation of Prim Algorithm

-7.7 The Idea of Topological Sorting of Graphs

--The Idea of Topological Sorting of Graphs

-7.8 Single Source Shortest Path of Graphs ——Dijkstra Idea

--Single Source Shortest Path of Graphs——Dijkstra Idea

-test7

8. Search

-8.1 Sequential Search

--Sequential Search

-8.2 Binary Search

--Binary Search

-8.3 Basic Concepts and Search of Binary Search Trees

--Basic Concepts and Search of Binary Search Trees

-8.4 Basic Concepts of Hash Table

--Basic Concepts of Hash Table

-8.5 Hash Functions

--Hash Functions

-8.6 Conflict-Handing Methods of Hash Table

--Conflict-Handing Methods of Hash Table

-test8

9. Sort

-9.1 Basic Concepts of Sorting

--Basic Concepts of Sorting

-9.2 Shell Sort

--Shell Sort

-9.3 Quick Sort

--Quick Sort

-9.4 Heap Sort

--Heap Sort

-test9

10. Comprehensive Experimental Analysis

-10.1 The Knight's Tour Problem

--The Knight's Tour Problem

-10.2 A Campus Tour Guide

--A Campus Tour Guide

-10.3 Maze Problem

--Maze Problem

examination

-exam

© 柠檬大学-慕课导航 课程版权归原始院校所有，
本网站仅通过互联网进行慕课课程索引，不提供在线课程学习和视频，请同学们点击报名到课程提供网站进行学习。