Data structures and algorithms

Data structures and algorithms, a compulsory computer course, have always been extremely boring and sleep-inducing no matter which school you go to.

However, Little Turtle decided to put a lot of effort into making this course a gorgeous, fun, illustrated course!

Little turtle data structure and algorithm courseware and source code

http://download.eeworld.com.cn/download/%E8%80%81%E7%99%BD%E8%8F%9C/585702

• Chapter 1：Introduction to data structures and algorithms (12 minutes and 48 seconds)

• Chapter 2：Talk about algorithms (20 minutes and 4 seconds)

• Chapter 3：Time complexity and space complexity (23 minutes and 56 seconds)

• Chapter 4：Time complexity and space complexity 2 (17 minutes and 44 seconds)

• Chapter 5：Time complexity and space complexity 3 (17 minutes and 8 seconds)

• Chapter 6：linear table (16 minutes and 59 seconds)

• Chapter 7：Linear table 2 (16 minutes and 41 seconds)

• Chapter 8：Linear table 3 (18 minutes and 22 seconds)

• Chapter 9：Linear table 4 (16 minutes and 2 seconds)

• Chapter 10：Linear table 5 (14 minutes and 58 seconds)

• Chapter 11：Linear table 6 (14 minutes and 56 seconds)

• Chapter 12：Linear table 7 (18 minutes and 32 seconds)

• Chapter 13：Linear table 8 (13 minutes and 59 seconds)

• Chapter 14：Linear table 9 (11 minutes and 20 seconds)

• Chapter 15：Linear table 10 (11 minutes and 43 seconds)

• Chapter 16：Summary of singly linked list: Tencent interview questions (18 minutes and 31 seconds)

• Chapter 17：Linear table 12 (23 minutes and 46 seconds)

• Chapter 18：Joseph problem (14 minutes and 50 seconds)

• Chapter 19：Linear table 14 (22 minutes and 1 seconds)

• Chapter 20：Magician's card dealing problem (18 minutes and 5 seconds)

• Chapter 21：Linear table 16 (11 minutes and 35 seconds)

• Chapter 22：Linear table 17 (37 minutes and 27 seconds)

• Chapter 23：stacks and queues (18 minutes and 10 seconds)

• Chapter 24：Stacks and Queues 2 (14 minutes and 8 seconds)

• Chapter 25：Base conversion (30 minutes and 31 seconds)

• Chapter 26：Stacks and queues 4 (8 minutes and 59 seconds)

• Chapter 27：reverse polish calculator (29 minutes and 40 seconds)

• Chapter 28：Convert infix expression to postfix expression (11 minutes and 45 seconds)

• Chapter 29：Convert infix expression to postfix expression (below) (16 minutes and 5 seconds)

• Chapter 30：Stacks and Queues 7 (10 minutes and 56 seconds)

• Chapter 31：Stacks and Queues8 (14 minutes and 36 seconds)

• Chapter 32：Recursion and divide-and-conquer ideas (16 minutes and 37 seconds)

• Chapter 33：Recursion and divide-and-conquer ideas 2 (17 minutes and 42 seconds)

• Chapter 34：Tower of Hanoi (23 minutes and 45 seconds)

• Chapter 35：Eight Queens Problem (33 minutes and 30 seconds)

• Chapter 36：string (12 minutes and 58 seconds)

• Chapter 37：KMP algorithm (18 minutes and 40 seconds)

• Chapter 38：KMP algorithm 2 (15 minutes and 38 seconds)

• Chapter 39：Analysis of the NEXT array code principle of KMP algorithm (22 minutes and 26 seconds)

• Chapter 40：The final implementation and optimization of KMP algorithm (13 minutes and 34 seconds)

• Chapter 41：Tree (11 minutes and 15 seconds)

• Chapter 42：tree storage structure (12 minutes and 9 seconds)

• Chapter 43：Tree storage structure 2 (16 minutes and 47 seconds)

• Chapter 44：Binary tree (16 minutes and 51 seconds)

• Chapter 45：Binary tree 2 (17 minutes and 28 seconds)

• Chapter 46：Binary tree storage structure (7 minutes and 17 seconds)

• Chapter 47：Binary tree traversal (9 minutes and 58 seconds)

• Chapter 48：Binary tree establishment and traversal algorithm (23 minutes and 11 seconds)

• Chapter 49：clue binary tree (14 minutes and 34 seconds)

• Chapter 50：Clue binary tree code implementation (48 minutes and 21 seconds)

• Chapter 51：Conversion between trees, forests and binary trees (11 minutes and 59 seconds)

• Chapter 52：huffman tree (14 minutes and 57 seconds)

• Chapter 53：Huffman coding (16 minutes and 5 seconds)

• Chapter 54：Huffman coding C language implementation (45 minutes and 3 seconds)

• Chapter 55：Definition and terminology of graphs (14 minutes and 47 seconds)

• Chapter 56：Definition and terminology of graph 2 (16 minutes and 4 seconds)

• Chapter 57：Graph storage structure (22 minutes and 18 seconds)

• Chapter 58：The storage structure of the graph (adjacency list) (7 minutes and 45 seconds)

• Chapter 59：Graph storage structure (cross linked list, adjacency multiple list, edge set array) (26 minutes and 46 seconds)

• Chapter 60：Graph traversal (depth-first traversal) (13 minutes and 27 seconds)

• Chapter 61：Horse treading chessboard algorithm (knight travel problem) (37 minutes and 18 seconds)

• Chapter 62：Graph traversal (breadth-first traversal) (13 minutes and 7 seconds)

• Chapter 63：Minimum spanning tree (Prim's algorithm) (21 minutes and 3 seconds)

• Chapter 64：Minimum spanning tree (Kruskal's algorithm) (23 minutes and 57 seconds)

• Chapter 65：Shortest path (Dijkstra's algorithm) (20 minutes and 33 seconds)

• Chapter 66：Shortest path (Freud's algorithm) (12 minutes and 13 seconds)

• Chapter 67：topological sort (19 minutes and 29 seconds)

• Chapter 68：Critical Path (11 minutes and 36 seconds)

• Chapter 69：Critical path (code explanation) (23 minutes and 54 seconds)

• Chapter 70：Find algorithm (9 minutes and 53 seconds)

• Chapter 71：Interpolation search (proportional search) (12 minutes and 25 seconds)

• Chapter 72：Fibonacci search (golden section search) (13 minutes and 4 seconds)

• Chapter 73：linear index lookup (11 minutes and 23 seconds)

• Chapter 74：Binary sorting tree (9 minutes and 6 seconds)

• Chapter 75：Search, insert and delete in binary sorted tree (12 minutes and 26 seconds)

• Chapter 76：Search, insertion and deletion of binary sorted tree 2 (18 minutes and 13 seconds)

• Chapter 77：balanced binary tree (8 minutes and 21 seconds)

• Chapter 78：The implementation principle of balanced binary tree (26 minutes and 12 seconds)

• Chapter 79：Implementation principle of balanced binary tree (code implementation) (26 minutes and 57 seconds)

• Chapter 80：Multi-way search tree 2-3 tree (10 minutes and 22 seconds)

• Chapter 81：The insertion principle of 2-3 tree in multi-way search tree (23 minutes and 17 seconds)

• Chapter 82：Principle of deletion of 2-3 tree in multi-path search tree (12 minutes and 14 seconds)

• Chapter 83：Multi-way search tree 2-3-4 tree and B-tree (13 minutes and 41 seconds)

• Chapter 84：Hash table (hash table) lookup (12 minutes and 16 seconds)

• Chapter 85：How to construct a hash function (14 minutes and 32 seconds)

• Chapter 86：How to deal with hash collisions (10 minutes and 21 seconds)

• Chapter 87：Code implementation of hash table lookup (12 minutes and 36 seconds)

• Chapter 88：Sorting Algorithm (13 minutes and 0 seconds)

• Chapter 89：Bubble Sort (18 minutes and 21 seconds)

• Chapter 90：selection sort (10 minutes and 28 seconds)

• Chapter 91：direct insertion sort (8 minutes and 5 seconds)

• Chapter 92：Hill sort (13 minutes and 0 seconds)

• Chapter 93：Heap sort (9 minutes and 12 seconds)

• Chapter 94：Code implementation of heap sort (14 minutes and 23 seconds)

• Chapter 95：merge sort (12 minutes and 17 seconds)

• Chapter 96：Merge sort (iterative implementation) (17 minutes and 13 seconds)

• Chapter 97：Quick sort (14 minutes and 23 seconds)

• Chapter 98：Optimization of quick sort (22 minutes and 8 seconds)

• Chapter 99：Summary review (7 minutes and 31 seconds)