## Basic structure and pointer of C + + language

C + + Basics 1. Cast type (typename) value typename (value) static_cast (value) / / is safer than traditional cast. 2. sizeof() and strlen() in character array strlen() calculates the length of the string, excluding \ 0, while sizeof() calculates the memory occupied, including \ 0 Examples are as follows: #include <iostream> ...

## PostgreSQL B + tree index -- concurrency control

B + tree index - concurrency control Preparatory knowledge B + tree index - basic structure B + tree index - query B + tree index - insert B + tree index - split summary Finally, we discuss the concurrency control of B + tree, which should be the concurrency control of B-Link tree. Concurrency control is the essence of B-Link. B-Link tre ...

## [C/C + +] implementation principle of ring queue

Ring queue is a very useful data structure in practical programming. It has the following characteristics. It is a FIFO data structure connected end to end. It adopts the linear space of array, and the data organization is simple. You can quickly know whether the queue is full or empty. Can access data at a fast speed. &nb ...

## Data structure personal notes Lesson 7 two way linked list

Bidirectional linked list A two-way linked list, that is, a linked list with two pointers, points to the previous node and the next node respectively Of course, bidirectional here means that the logical relationship between nodes is bidirectional, but usually only one header pointer is set, unless required by the actual situation. Each node ...

## Summary of common data structures and algorithms

Algorithm knowledge summary This part is mainly the author's notes on learning algorithm knowledge and some relevant interview questions. If there are errors, I hope you can point out! catalogue Summary of common algorithms and data structures sort Bubble sortingSelect sortInsert sortShell Sort Merge sortQuick sortHeap sortCardinalit ...

## HashMap interview Basics

1. Underlying data structure of HashMap JDK1.7 and before: array + linked listJDK1.8: array + linked list + red black tree We all know about the basic of HashMap, but why must the length of the array be an exponential power of 2, why should the loading factor of HashMap be set to 0.75, and why is it converted into a red black tree when th ...

## Stack and Queue

1, Basic concepts of data structure 1. Logical structure, logical relationship between data (1) Assembly mechanism: assembly The data elements in the structure have no relationship except "belong to the same set" (2) Linear structures: tables The data elements in the structure have a one-to-one relationship (3) Tre ...

## Java data structure and algorithm

catalogue data structure linear structure Nonlinear structure Sparse arrays and queues Basic introduction The idea of transforming two-dimensional array into sparse array The idea of transforming sparse array into original two-dimensional array Code implementation of sparse array Operation results queue Array emul ...

## [4] Find the median of two positive ordinal arrays (C#)

Find the median of two positive ordinal arrays subject _Given two positive (from smallest to largest) arrays of m and n, nums1 and nums2. Find and return the median of these two positive ordinal arrays. Example: _Input: nums1 = [1,3], nums2 = [2] _Output: 2.00000 _Interpretation: Consolidated Array= [1,2,3], Median 2 Example: _ ...

## Brief discussion on JVM memory model

Main components of JVM Function: first, compile the. java file into. Class file through the compiler, and then the class loader loads the bytecode file into memory. It is placed in the method area of the runtime data area, and the bytecode file is only a set of instruction specifications of the jvm and cannot be directly executed by the ...