No self-introduction
Loading
Profile
Follow
codes (7)
Local mean decomposition (LMD) simulation code
no vote
Local mean analysis LMD simulation code, this is a good resource of LDM, very useful, measured available, can be changed according to their own situation//////////////////////////////////////////////////////////////////////////////////////////////
chenyk00 0 0
1
Eight queens described by C language
no vote
Eight queens are placed on an 8 × 8 chess table so that they can't attack each other, that is, any two Queens can't be in the same row, column or diagonal line. How many kinds of pendulum are there
chenyk00 0 0
1
C language describes the operation of linear linked list algorithm
no vote
1. Build the index table of the order index link storage structure, the key words are 0 ~ 9, and the pointer is empty; 2. Generate 100 integer random numbers of 0 ~ 99, and store the random numbers in the corresponding sub table with the number of bits as the key words; 3. Output all the elements in the corresponding sub table according to the key words (0 ~ 9); 4. Input a data x, delete all the data in the storage structure, and then do the third step
chenyk00 2 0
1
Using C language to describe algorithm and stack to realize expression processing
no vote
Stack processing expression & quot; a + b * C-D / E has been tested
chenyk00 0 0
1
C language describes the operation of algorithm circular linked list
no vote
Complete the following operations on the circular list: create an empty circular list; insert new elements; scan and output the elements in the circular list; insert new element B before the elements containing x; delete the elements containing x;
chenyk00 1 0
1
C language description of Hanoi Tower problem
no vote
When Brahma created the world, he made three diamond pillars, on which 64 pieces of gold discs were stacked in order of size from bottom to top. Brahman ordered Brahman to rearrange the disk on another pillar in order of size from below. It is stipulated that the disk can not be enlarged on the small disk, and only one disk can be moved between the three pillars at a time.
chenyk00 1 0
1
Constructing Huffman tree with C language description
no vote
Methods: (Huffman algorithm) 1. N leaves constitute the set F of N subtrees, with weight wk and no parent or child nodes. ② Find two trees with the smallest weight from F as left subtree and right subtree to construct a tree. The weight of the new tree is the sum of the original two trees. Delete the original two trees from F and add the new tree to F. ③ Repeat 2 until there is only one tree in F, the Huffman tree.
chenyk00 0 0
1
No more~
Follows0
Fans0