Static linked list of datastructure series of Dahua

Article directory Definition Form Insert element of static linked list Existence meaning Advantages and disadvantages of static linked list Code implementation (C, Java) Definition Form Let the elements of the array consist of two data fields, data and cur. Each subscript of the array corres ...

Posted on Sun, 19 Jan 2020 03:59:51 -0500 by alliance

Data structure (C language) lesson 7 - maze solution

Data structure (C language) lesson 7 - maze solution Title Description: The maze is represented by a rectangular matrix of m*n, and the paths and obstacles in the maze are represented by 0 and 1 respectively. A program is designed to find a path from the entrance to the exit for any maze, or to dr ...

Posted on Sun, 12 Jan 2020 10:04:41 -0500 by damic

Data structure (C language) course 5: drug sales statistics system of drugstores

Data structure (C language) course 5: drug sales statistics system of drugstores Title Description: You work as a warehouse keeper in an L drug store, and you will go home for the new year's holiday soon. L drug store has made statistics on the sales of this year, but it seems to be too messy. So yo ...

Posted on Sun, 12 Jan 2020 08:07:37 -0500 by adeelzia

Learn from GCC the implementation of message extension function of C language ﹣ SM3 hash algorithm

According to the standard documents of SM3 hash algorithm, it is easy to write the C language implementation of its message extension function: #include <stdint.h> void expand_data(uint32_t W[68], uint32_t data[16]) { uint32_t j, P1, X; for(j = 0; j < 16; j++) W[j] = data[j]; for(j = 16; j < 68; j++) { X = W[j-16] ...

Posted on Tue, 07 Jan 2020 01:47:27 -0500 by php1999

Children learn classical algorithm (13): two number exchange

When learning C language, I learned two digit exchange: "children learn C language (25): two digit exchange"https://www.jianshu.com/p/64bc70f0abfe When learning C + +, I also learned two digit exchange: "children learn C + + (14): two digit exchange"https://www.jianshu.com/p/9a071870e0a0 What we have to consider ...

Posted on Mon, 06 Jan 2020 05:27:18 -0500 by jrmontg

The life cycle of variables and static modified variables

In C language or C + +, many variables need to be defined. Since a variable is defined, it must have a scope of action (life cycle). Variables with the same name in different scopes are allowed in C language or C + +. Variables are generally divided into global variables and local variables according to the scope of action. Gen ...

Posted on Sat, 04 Jan 2020 08:18:45 -0500 by JaneDoe

Fish in three days and net in two days

There is a saying in China that "fish in three days and sun in two days". From January 1, 2010, someone began to "fish for three days and dry the net for two days". He asked whether he was "fishing" or "drying the net" in the future. Using C or C + + language / java/python to solve the pr ...

Posted on Sat, 04 Jan 2020 00:05:22 -0500 by blacksnday

A simple binary tree input and output operation for C language review data structure

The input-output only operation of a simple binary tree for C language review 1: Structure typedef struct TreeNode{ _Data value; struct TreeNode * father; struct TreeNode * right; struct TeenNode * left; }* pNode, Node; 2: Function declaration pNode createNode(_Data value);//Create node void printTree(pNode ...

Posted on Thu, 02 Jan 2020 07:47:05 -0500 by [n00b]

LMS algorithm to realize adaptive filter (matlab version)

LMS algorithm to realize adaptive filter (matlab version) In order to prepare for the provincial electronic competition, I specially made the topic of adaptive filter in 2017 national electric competition. This LMS program is matlab version only to understand the LMS algorithm. Later, I will upload the LMS algorithm based on t ...

Posted on Wed, 01 Jan 2020 22:04:16 -0500 by virtual_odin

C language to solve the problem of bracket matching and inverse Polish expression evaluation

1. Bracket matching problem: Solution: void MatchBrackets (const char* str) { char* per = NULL; int i = 0; Stack s; assert (str != NULL); InitStack (&s); per = (char*)str; for (i=0; per[i] != 0; i++) { if ('(' == per[i] || '[' == per[i] || '{' == per[i]) { PushS ...

Posted on Tue, 31 Dec 2019 01:01:36 -0500 by wiredweb