# The most complete and detailed data structure and algorithm Video – [with courseware and source code]

Time：2020-10-25

Source code and courseware download mode at the end of the article

1. What are data structures and algorithms

Algorithms are used to design and implement a computer-based solution to a problem. It satisfies the following properties:

Input: there are zero or more inputs output: generate at least one output certainty: the instruction of the algorithm is clear and unambiguous, and the execution time of the algorithm is limited

The process of using computers to solve production problems can be divided into the following five steps:

Problem understanding: make clear the input, requirement and output of the problem.

Data structure design: design the data structure that can handle the data in the problem, and also design the data structure that can support the algorithm strategy.

Algorithm design: select algorithm strategy, describe and refine algorithm step by step in appropriate way.

Algorithm analysis: find the optimization, return to the second step, redesign the data structure and algorithm

Program realization: use computer programming, define data structure, write code to realize, and height and run.

1. brief introduction

The highlights of this course are:

1. It is jointly researched and developed by Mr. MJ and Mr. Dong Fuchun, a famous enterprise algorithmic master. The whole process is carefully built to ensure the systematicness, comprehensiveness and high gold content of the course.

2. In depth explore the underlying implementation of each line of code, so that learners can better understand the source code of each framework and use the framework more efficiently; and when developing large projects, they have the ability to achieve the ultimate optimization of performance.

3. Mr. MJ gave lectures in person, combined with a large number of real cases of enterprises, which was easy to understand and easy to understand.

1. Video chapter

Contents]

01. Bubble, select, heap sort.mp4

2. Insert sort.mp4

Merge sort.mp4

4. Fast, hill sort.mp4

05. Counting, cardinality, bucket sorting.mp4

│ 06. Parallel search.mp4

Graph, BFS, DFS, topological sort.mp4

│  08.kruskal、prim.mp4

│  09.dijkstra、bellman-ford、floyd.mp4

│  10.KMP、BM、KR、Sunday.mp4

│  11.Dijkstra.mp4

12. Dijkstra perfect, Bellman- Ford.mp4

13. Recursion, backtracking.mp4

14. Tail call, tail recursion, backtracking.mp4

Cutting branches, n queen problem (1). Mp4

16-1. Greed, divide and conquer.mp4

16-2. Greed, divide and conquer.mp4

Large number multiplication, preliminary dynamic programming.mp4

Large number multiplication, preliminary dynamic programming.mp4

The largest continuous subsequence and the longest ascending subsequence.mp4

The longest common subsequence.mp4

The longest common subsequence.mp4

The longest common substring, 0-1 knapsack problem.mp4

The longest common substring, 0-1 knapsack problem.mp4

The implementation of LIS binary search_ Bloon filter.mp4

The implementation of LIS binary search_ Bloon filter.mp4

22-1. Skip table search.mp4

22-2. Skip table search.mp4

23. Adding and deleting jump tables, bplus tree.mp4