## [data structure] C language implementation of sequential stack (sequential storage of stack through sequential table)

Principle of realizing sequence stack with sequence table Stack is a special linear table. It can only insert and delete at one end of the linear table. The end that allows insertion and deletion is called the top of the stack and the other end is called the bottom of the stack. The sequential storage of stack, namely sequential stack, refers ...

Posted by matthewlesh on Sat, 02 Apr 2022 06:23:07 +0300

## (c language implementation) bfs and pta exercises of algorithm notes

catalogue 1, Definition of bfs (breadth first search) 2, Application of BFS (breadth first search) 3, Question type training 1. Strange elevator 2. Treasure hunt 3. Tequila bar 4, Summary         1, Definition of bfs (breadth first search) BFS full name is Breadth First Search , the Chinese name is breadth first search, also kno ...

Posted by pieychpi on Fri, 01 Apr 2022 13:08:09 +0300

## NOJ data structure experiment of West University of technology -- 2.1 sparse matrix transpose

There are two ways to transpose the sparse matrix according to the teacher. I use the first and simplest one. I have to walk line by line from top to bottom. Although the speed is very slow, it is simple. To tell you the truth, this topic is very annoying. mu in the triplet we define represents the number of rows, but m required by the topic ...

Posted by Murciano on Fri, 01 Apr 2022 11:34:53 +0300

## "About c language implementation of simple version (non code) tic tac toe chess games"

First of all, we should consider how to realize the chessboard and how to store chessmen.The character array in C language can realize the storage position. The character array of three times three is used as a part of the chessboard. In C language, one character "'" can be used as the state without chessboard, the character "X&q ...

Posted by juancuca on Thu, 31 Mar 2022 18:11:25 +0300

## [fundamentals of C language 6 - array]

preface This article mainly reviews and exercises the previous contents. The learning contents include but are not limited to: Branch and loop statementsfunctionarray In this paper, we need to write the game of Sanzi chess to relearn the knowledge points. 1. What is Sanzi? 1.1 Baidu Encyclopedia Sanzi is a kind of black and white ...

Posted by mpirvul on Wed, 30 Mar 2022 08:56:24 +0300

## Dynamic memory address book [implemented in C language]

preface Overall thinking First, briefly describe the idea of fixed capacity address book, and then optimize the address book with dynamic growth capacity Information packaging The address book should contain a person's name / gender / age / telephone / address, etc., which requires a structure peoinfo to package personal information. ...

Posted by MiniMonty on Wed, 30 Mar 2022 08:33:46 +0300

## ESP32 learning notes HTTP application

ESP32 learning notes (5) HTTP application Note: for the study of this part, please refer to the demo program under ESP IDF: ...\esp-idf\examples\protocols\esp_http_client I A brief introduction to HTTP Http – Hyper Text Transfer Protocol is a stateless connection established on TCP. The whole basic workflow is that the client sen ...

Posted by weknowtheworld on Wed, 30 Mar 2022 02:57:08 +0300

## PTA - romantic confession (C language)

A handsome guy has been secretly in love with a girl, but he still doesn't have the courage to say "I love you" to her, let alone "so and so, I love you. If you have to add a deadline to this' love ', it's 10000 years". I'm afraid that after saying it, it will be "falling flowers are deliberately ruthless", and eve ...

Posted by Webbyturtle on Tue, 29 Mar 2022 21:30:57 +0300

## [handle] stm32 configure LwIP+Ping+TCPclient with CubeMX to send information to PC

Tip: after the article is written, the directory can be generated automatically. Please refer to the help document on the right for how to generate it preface This is my first blog. Welcome to give some encouragement and suggestions! Due to my hobby, I quit my civil engineering job and joined a technology company less than a month ago ...

Posted by rnintulsa on Mon, 28 Mar 2022 07:33:08 +0300

## PTA array (C language)

1. Sorting by selection method (20 points) This problem requires that the given n integers be sorted from large to small and then output. Input format: The first line of input gives a positive integer n of no more than 10. The second line gives n integers separated by spaces. Output format: Output an ordered sequence of numbers from large to ...

Posted by Saethyr on Mon, 28 Mar 2022 05:07:01 +0300