Programmer Group

  It's not easy to create, my guest, pay attention, collect and subscribe to one button three times ❤😜          preface Program = data structure + algorithm. Algorithm is a mixture of mathematical theory and engineering implementation. It is a very interesting and magical knowle ...

Algorithm Fourth Edition: 1.1.27 binomial distribution, from 10 to 10 billion@ TOC Recursive method to realize binomial distribution operation, O(2^N) The recursive algorithm is relatively simple. It is very suitable for small parameters. But the problem is also obvious. N * k > 100 is very slow at the beginning. When > 1000, the progr ...

Title Description Determines whether a number n is a happy number. The definition of happy number is as follows: Starting with any positive integer, replace the number by the sum of the squares of its digits. Repeat the process until the number equals 1 (where it will stay), or it loops endlessly in a cycle which does not include 1. Those ...

catalogue   1. Topic introduction   Let's start with the topic  ， It is convenient to understand and reflect the algorithm more intuitively 2. Introduce my understanding of the implementation of prim algorithm code in books 1. Function of lowcast array 2. Function of adjvex array 3.kruskal algorithm 3. If you want the sou ...

catalogue 1. Summary 2. Introduction of two-way circular linked list     2.1. Bidirectional linked list     2.2. Circular linked list     2.3. Two way circular linked list 3. Code implementation     3.1. Header file     3.2. Interface documents     3.3. Test documents 4. References 1. Summary This paper mainly introduces the concept of two ...

A stack is a linear table that can only be inserted or deleted at one end. (linear table with limited operation)          The stack can only insert or delete elements at the end of the table. The end of the table is the top of the stack, and the header is the bottom of the stack Main features of stack: ...

1. Experimental Purpose and Requirements The main purpose of this internship is to enable students to master the basic operation of linear tables in order storage structure and chain storage structure, and to improve the analysis and problem solving ability. You are required to read and understand the following examples carefully, go throu ...

7-5 tribes (20 points) subject In a community, everyone has his own small circle and may belong to many different circles of friends at the same time. We think that all friends of friends are in one tribe, so please count how many disjoint tribes there are in a given community? And check whether any two people belong to the same tribe. Input ...

Implementation of stack Stack is an important data structure. It is a linear structure with the characteristics of last in first out Because there are two implementations of linear table, there are also two implementations of stack, namely sequential storage structure and chain storage structure. This paper gives an implementation based on cha ...

Huffman code Description:         Huffman coding uses the use frequency of characters to encode, and adopts the coding method of variable length, so that the frequently used character coding is shorter and the infrequently used character coding is longer;         Huffman coding has two characteristics ...