CPU intensive IO intensive
1: CPU intensive:
Definition: CPU intensive also refers to calculation intensive. Programs that spend most of their time doing CPU actions such as calculation logic judgment are called CPU intensive tasks. This type of task requires a lot of calculation, which mainly consumes CPU resources. Although this kind of comp ...
Resources for all experiments
Extraction code: iv72
Write in front
Description of algorithm principle for solving problems
Solving two lines of code similarity: LCS
LCS state transition equation:
LCS question: the a ...
Added by noppie on Sat, 27 Jun 2020 12:49:27 +0300
Use custom communication protocol in most TCP communication scenarios
Sticky Packet Processing Principle: Buffer data sent by clients N times into a single packet by the size of the packet in the request header
Request header takes up 3 bytes (instruction header 1 byte, packet length 2 bytes), ...
Added by kellerkind on Fri, 26 Jun 2020 19:08:50 +0300
Always believe that good things are about to happen
Some time ago, I encountered such a problem when crawling the website data. There is a data source. Because of the large amount of data, it is not displayed on the page, only a download button is provided. Now it is necessar ...
Added by pipe_girl on Thu, 25 Jun 2020 13:20:40 +0300
Define a class and create a class instance
Binding instance properties for objects
Creating and using instance methods
Static class method
General definition method: lack of concealmen ...
Added by CompuWorld on Tue, 23 Jun 2020 08:48:35 +0300
MCU platform libjpeg9 porting instructions
With the performance of MCU platform becoming more and more powerful, it is possible to use jpeg soft decoding on MCU. This paper will explain the migration of libjpeg.
libjpeg is a widely used JPEG image compression / decompression open source library, which ...
Added by milind24 on Sun, 21 Jun 2020 13:26:51 +0300
Stack implementation synthesis calculator (infix expression)
We need two stacks: number stack and symbol stack to define an index index index index to traverse the expression
Traverse to a number, then enter the number stack
Traverse to a symbol. If the symbol stack is empty, it wil ...
Input an increasing sort array and a number S, find two numbers in the array, make their sum S, and output any pair.
Seeing this problem, the simplest way we can think of is to fix a number first, and then judge whether the sum of n - 1 numbers is S, but the time complexity is O(n^2).
You can ...
Added by installer69 on Sat, 20 Jun 2020 12:13:26 +0300
1. Biscuit distribution (NO.455)
Title Description: suppose you are a great parent and want to give your children some cookies. However, each child can only be given one cookie at most. For each child i, there is an appetite value gi, which is the minimum size of biscuits that can satisfy the children ...
Here, we will introduce and explain the feature data selection methods often used in Feature Engineering, which are divided into three parts: single variable selection, linear model selection and random forest model feature selection.
Trilogy 1: single variable selection
For data scientists or m ...