C + + address book management system
preface
After watching the video of the dark horse during this period, summarize from the case and review the old to know the new.
1, System requirements
Address book is a tool that can record the information of relatives and friends.
The functions to be realized in the system are as follows:
Add contact: add a new person to t ...
Posted by HavokDelta6 on Sun, 07 Nov 2021 19:52:25 +0100
Rewrite some functions of C language string.c
1, Function introduction
This is the third article on rewriting some functions of C language string.c. The following functions have been rewritten in the previous two articles:
strdup String copy
strchr Character lookup function (Start from scratch)
strrchr Character lookup function(Start from the tail)
strcat strncat String splicing funct ...
Posted by phbock on Sat, 06 Nov 2021 23:30:07 +0100
C++11 concurrency and multithreading note taking singleton design pattern share data analysis, solution, call_once
1. About design patterns
Design pattern
Some writing methods of the code (these writing methods are different from the conventional writing methods), so that the program written by the code is flexible and easy to maintain, but others take over and read the code is very painful.The code written with the concept of "design patter ...
Posted by ksandom on Sat, 06 Nov 2021 23:00:11 +0100
(c + +) comprehensive case of STL school speech contest
Problem description
1) A city held a speech_contest, in which 24 people participated. There are three rounds in the competition. The first two rounds are the knockout and the third round is the final. 2) Competition mode: group competition, with 6 people in each group; Players should be randomly divided into groups for competition each tim ...
Posted by konky on Sat, 06 Nov 2021 17:53:51 +0100
Zero basis plays with the third chapter of C language series - circular statements
[preface]: the knowledge points supplemented by circular sentences are very important. Iron juice should be recorded with snacks.
1, while statement
while statement
while((expression)
{
Loop statement;
}
[knocking on the blackboard]: the execution times of the conditional expression are 1 more than that of the loop body.
break and ...
Posted by hd_webdev on Sat, 06 Nov 2021 17:46:47 +0100
C++11 concurrency and multithreading unique_lock details
1,unique_lock replaces lock_guard
unique_lock
Is a class template. In work, lock is generally used_ Guard (recommended); lock_guard replaces lock() and unlock() of mutex;unique_lock is better than lock_ The guard is much more flexible; The efficiency is a little poor, and the memory takes up a little more.In normal use, there is no d ...
Posted by naturalbeauty7 on Sat, 06 Nov 2021 08:16:43 +0100
Lab0- C++ Primer 65f59c1475a6407e8b8adf0f1b699e05
Lab0- C++ Primer
💡 unique_ptr, matrix multiplication, gdb, etc.
Code download
Follow the document steps under the project: // 1. Create a new warehouse, bus private
// 2. clone cmu db remote code to local
git clone --bare https://github.com/cmu-db/bustub.git bustub-public
cd bustub-public
// 3. mirror to the remote warehouse you just ...
Posted by Plxply on Sat, 06 Nov 2021 07:40:20 +0100
Codeforces Round #753 (Div. 3) (A~E)
A. Linear Keyboard
General idea of the topic
The first line gives you a string with a length of 26, representing the order of 26 letters, and the distance between adjacent letters is 1. The second line gives you a string and asks how long it took to walk from beginning to end.
Problem solving ideas
Just enumerate.
AC code
#inclu ...
Posted by sargus on Sat, 06 Nov 2021 03:11:24 +0100
Summary of Review Data for Final Examination of Algorithmic Design and Analysis in Northwest Polytechnic University
Review of Algorithmic Design and Analysis Test
Theories
1. Basic concepts and properties of algorithms and their relations and differences with programs
Algorithms: Algorithms refer to a series of calculation steps to solve a problem, which is an accurate and complete description of the solution.
Basic properties of the algorithm:
Input: T ...
Posted by kimbeejo on Fri, 05 Nov 2021 18:38:09 +0100
Super detailed decomposition of strongly connected components
(it's a little small. Take your time and you'll get something) (1) First we have to understand, what is strong connectivity? If a path from u to v can be found in any two points u and v in the vertex subset of a directed graph, the subset is called strongly connected
(2) Second, we have to understand what is a strongly connected component? If ...
Posted by InfinityRogue on Fri, 05 Nov 2021 03:54:33 +0100