No self-introduction
Loading
Profile
Follow
codes (11)
Hashtable
no vote
Hash table (also known as hash table) is a data structure directly accessed according to the key value. In other words, it can access records by mapping key values to a location in the table to speed up the search. This mapping function is called hash function, and the array of records is called hash table.
auu56 0 0
1
Static search
no vote
Static look-up table does not change the state of the table in the process of searching. It is suitable for finding tables that do not change or change frequently. Such as college entrance examination score sheet, the unit staff information sheet, etc. The following describes the sequential search, the half search of the ordered table, and the search of the static tree table.
auu56 0 0
1
Threaded binary tree
no vote
Through the investigation of all kinds of binary linked lists, no matter what the shape of the child tree is, the number of empty chain fields is always more than that of non empty chain fields. To be exact, the binary list of N nodes has a total of 2n chain domains, and the non empty chain domain is n-1, but the empty chain domain is n + 1. In this paper, a method is proposed, which uses the original empty chain domain to store pointers to other nodes in the tree. This pointer is called a cue.
auu56 0 0
1
Adjacency matrix creation
no vote
The creation of graph mainly uses the input vertices and stores them in a vector (one-dimensional array), and then creates an arc by inputting two vertices and weights, which is represented by a two-dimensional array. Therefore, the storage of graph created by adjacency matrix needs two arrays: a one dimension group and a two-dimensional array.
auu56 0 0
1
balanced binary tree
no vote
Definition of balanced binary tree: it is either an empty tree or a binary tree with the following properties: the absolute value of the depth difference between its left and right subtrees is not more than 1, and its left and right subtrees are both a balanced binary tree. Balance factor (BF): the depth of the left subtree of the node minus the depth of the right subtree, then obviously - 1 & lt; = BF & lt; = 1; Obviously, the balanced binary tree is introduced on the binary sort tree (BST), which is to solve the problem that the time complexity is greatly reduced due to the imbalance of the binary sort tree. Then AVL maintains the best time complexity O (logn) of the binary sort tree (BST), so every insertion and deletion must ensure the balance of the binary tree,
auu56 0 0
1
Binary sort tree
no vote
Binary sort tree: either an empty tree or a binary tree with the following properties: & nbsp; if its left subtree is not empty, then the values of all nodes on the left subtree are less than the values of its root node; if its right subtree is not empty, then the values of all nodes on the right subtree are greater than the values of its root node; its left and right subtrees are also binary sort trees.
auu56 0 0
1
C # background template
no vote
C # background page template, which is a static web page. This page can be used as the background management system reference.
auu56 0 0
1
Implementation of sequential stack
no vote
As a special linear table, stack has two kinds of storage structure in computer: sequential storage structure and chain storage structure. According to this, we divide stack into sequential stack and chain stack
auu56 0 0
1
Static linked list
no vote
Linear list can also be described by one-dimensional array. This description method is convenient to use linked list structure in high-level programming language without pointer type.
auu56 0 0
1
GUI uses BP neural network algorithm to recognize numbers
no vote
The neural network algorithm is used to train the image, and the GUI interface is used to read the image. Finally, the recognized image value is returned to the GUI interface
auu56 1 0
1
View More
Follows0
Fans0