1 What are data structures and algorithms? 1.1 Data structures
- The arrangement of data on memory or on disk is a form of organization of data. The basic data structures include arrays, lists, stacks, queues, trees, hash tables, graphs, and heaps.
1.2 Algorithm
- is the way or process of processing the data in the structure.
- Broadly speaking, this is the way to solve the problem.
2 relationship of data structure and algorithm
- Data structure is for the algorithm service, many algorithms depend on the specific data structure, but not all the algorithm, the algorithm can not be related to the data structure.
3 Benefits of learning data structures and algorithms
- The correct choice of data structure and algorithm, can make the program more robust, more efficient operation, therefore, data structures and algorithms are the basic skills of each software developer, but also one of the most important basic skills.
4 arrays
- Operation of unordered and ordered data
- Binary Method Search
- Storing objects
- Large O-notation.
5 Stacks
- Linear table
- Stack
- Operation of the Stack
- Examples of stacks
- Suffix expression
6 queues
- Queue
- Implementation of the queue
- Loop queue
- Dual-ended queues
- Priority queue
7 Linked List
- Linked list
- Single linked list
- Double-ended linked list
- Linked list implementation stack and queue
- Ordered linked list
- Doubly linked list
8 Recursive algorithm
- Recursive
- Factorial
- Divide and conquer algorithm
- Fibonacci sequence
- Hanoi Tower Problem
- Knapsack problem
- Merge sort
9 Sorting algorithm
- Bubble sort
- Select sort
- Insert Method Sort
- Hill sort
- Quick Sort
- Base sort
- Sort objects
102 Fork Tree
- The concept and properties of binary tree
- Realization of Binary Tree
- Huffman coding, Huffman tree, Huffman algorithm
- Using Huffman algorithm to achieve compression and decompression functions
11 Red and black trees
- The concept and characteristics of red and black trees
- Rules and corrections for red and black trees
- The rotation of the red and black trees
- The realization of red and black trees
12 2-3-4 Tree
- The concept and rules of the 2-3-4 tree
- 2-34-Tree Implementation
- The relationship between 2-3-4 tree and red-black tree and the rules of conversion
B-Tree
- B-Tree concepts and characteristics
- The height of the B-tree
- Implementation of B-tree
- Deformation of B-tree
14 Stacks
- Concept and characteristics of the heap
- Implementation of the Heap
- Sort of heap
15 Hash Table
- The concept and pros and cons of a hash table
- The construction of hash function
- Hash conflict resolution (open address method and chain address method)
- Hash string
16 Figure
- Concept and basic terminology of graphs
- Depth and breadth search
- Minimum spanning tree
- Topology of a forward graph
- Connected to a graph
- Warshall algorithm
- Minimum spanning tree with weighted graphs (Primm algorithm)
- Shortest path problem (Dijkstra algorithm and Freud algorithm)
Overview of data structures and algorithms
