## Data structures and algorithms

#Data structure and algorithm Introduction Logical structure Physical structure Talk about algorithm Algorithm time complexity Just tell you to pay attention to the highest order, then ignore the constant product of constant and order, and pay attention to enough data. The number of executions is ...

Added by Ryan0r on Sun, 19 Sep 2021 12:49:19 +0300

## Algorithm learning recursive algorithm

Application conditions This blog summarizes and reflects on the MOOC course of data structure and algorithm by Chen Bin of Peking University. Recursion is an elegant way to understand problems, and it is also a place where I was confused in the process of learning. To understand recursion, keep in mind the three elements of recursive app ...

Added by goosez22 on Sun, 19 Sep 2021 08:34:52 +0300

## Data structures and algorithms - linear search - binary search

This article is an original article of Joshua 317. Please note: reprinted from Joshua 317 blog Data structures and algorithms - linear search - binary search - Joshua 317's blog 1, Binary search description Binary Search, also known as Binary Search, requires the data sequence to have a linear structure, that is, the sorted data sequence. For ...

Added by Stalingrad on Sat, 18 Sep 2021 16:40:24 +0300

## Monotone stack and monotone queue

Directory QWQ Monotone stack and monotone queue abstract Monotone queues and monotone stacks require monotone elements on the basis of ordinary queues and stacks. In fact, the application of monotone queues and monotone stacks is also based on their monotonicity. In fact, I don't think the difference between these two special data struc ...

Added by gregtel on Sat, 18 Sep 2021 09:10:23 +0300

## JS Implements Binary Find Tree

JS Implements Binary Sort Tree Preface _Binary sorting tree was not intended to be written, there was no difficulty found, want to start directly from the rotation of the AVL tree, but because I saw an interview topic from others, I inserted Key's code in my handwriting, so I thought I would do it. _There is still a big difference between ...

Added by Voodoo Jai on Thu, 16 Sep 2021 02:45:48 +0300

## Implementation of student information management system with linked list

Using linked list to realize student achievement management Objective / function: linked list A, each node stores A new head node of linked list B1, B2, B3, B4 and B5. Scene: A grade, equivalent to A linked list There are 5 classes in this grade, with 5 people in each class, which is equivalent to the linked list B1 – B5 Do a student ach ...

Added by RonDahl on Wed, 15 Sep 2021 04:59:24 +0300

## Learn data structure together - linear table 1

Some concepts and definitions 1. Linear table, what is a linear table? We went to buy milk tea and there was a long line. This is the linear table. We call the roll in class and the names in the list from top to bottom. This is also a linear table. 2. What is the concept of linear table? A finite sequence of zero or more data elements. 3. It ...

Added by MartinGr on Tue, 14 Sep 2021 01:46:19 +0300

## [sword finger Offer] search algorithm

Today's problem begins to take the postgraduate entrance examination algorithm, and the problem has become much more interesting. The array inversion of the second problem is a very classic example, which is worth pondering carefully. Sword finger Offer 04. Search in two-dimensional array In an n* m two-dimensional array, each row is sorted i ...

Added by spoons84 on Mon, 13 Sep 2021 20:02:33 +0300

## The 15th Chinese Northeast College Programming Contest D. lowbit

D. Lowbit Original question link In this question, we wonder whether it will become a normal interval operation after adding a certain number of times, which is similar to interval root opening. Then we find that it is true that when a number is added to a certain number of times, there is actually only one binary ...

Added by mastercjb on Sun, 12 Sep 2021 03:33:04 +0300

## C + + container notes

C + + container General characteristics A basic feature of all containers is that it holds elements in "value" semantics. That is, the container stores copies and copies of elements, not references. Cost: high overhead and reduced performance. resolvent: 1. Try to implement transfer construction and transfer assignment function ...

Added by lihman on Sat, 11 Sep 2021 22:54:58 +0300