Programmer Group

Array sorting algorithm Algorithm = data structure + program code 1. Sorting: Suppose that the sequence containing n records is {R1, R2,... Rn}, and the corresponding keyword sequence is {K1, K2,..., Kn}. Reorder these records to {Ri1,Ri2,... Rin}, so that the corresponding keyword values meet the requirements of Ki1 < = ki2 < =... < ...

Bubble sort algorithm Bubble sorting repeatedly traverses the sequence to be sorted, comparing two adjacent elements each time, and exchanging them if their order is wrong. Repeat the traversal until there is no need to exchange, indicating that the sequence has been sorted. Algorithm steps: Compare adjacent elements: if the first is la ...

1. Linked list The construction of sequence table needs to know the data size in advance to apply for continuous storage space, and the data needs to be relocated during expansion, so it is not very flexible to use. Linked list structure can make full use of computer memory space and realize flexible dynamic memory management. 1.1 definit ...

101. Symmetric binary tree To judge whether the mirror image is symmetrical, make a dotted line in the middle to judge whether the half fold coincides. For example, the root node depends on whether its left child node and right child node are the same, and then the left child node of the left child node and the right child node of the right c ...

1. Tree structure 1.1 definitions Tree is a nonlinear data structure, which is composed of n( n ≥ 0 n\geq0 n ≥ 0) finite nodes form a set with hierarchical relationship. It is called a tree because it looks li ...

On the right side of the page, there is a directory index, which can jump to the content you want to see according to the titleIf not on the right, look for the left Main article: https://blog.csdn.net/grd_java/article/details/120526149 Why is there a map Linear table and tree, linear table is limited to a direct precursor and a direct suc ...

brief introductiondequeue refers to a two-way queue, which can insert and obtain data from the head of the queue or from the tail of the queue.This article will introduce how to create dequeue and some basic operations of dequeue.Implementation of bidirectional queueLike ordinary queue items, bidirectional queues can be inserted and deleted at ...

Title address: https://leetcode-cn.com/study-plan/lcof/?progress=xcewnbs summary When looking for the middle node of the chain table, use the fast and slow pointers, when both the fast and slow pointers are initially pointing to the head, the end condition cannot be while(fast!=null&&fast.next!=null) Because of this, if I judge ...

1. Concept of algorithm Algorithm is the essence of computer processing information, because computer program is essentially an algorithm to tell the computer the exact steps to perform a specified task. Generally, when the algorithm is processing information, it will read the data from the input device or the storage address of the data, ...

catalogue 🌠DFS 🌠BFS 🌠 Breadth first traversal of trees and graphs → topological sorting Example: 🌠 shortest path   👉 Single source shortest path (naive Dijkstra) (there must be no negative weight edge) → heap optimization Dijkstra (to be continued...) 👉 Single source shortest path with negative weight edge (Bellm ...