Seven commonly used sorting algorithms -- implementation of binary tree sorting

Introduction to binary sort tree Binary sort tree is also called binary search tree. Simply speaking, the storage of data should conform to the principle: the nodes on the left should be smaller than the root node, and the nodes on the right should be larger than the root node, so as to avoid the same (the same can be placed left and right) ...

Posted on Sat, 23 May 2020 10:53:04 -0400 by chanw1

C ා data operation series - 14 in depth exploration of SqlSugar

0. Preface In the last article, we know how to use SqlSugar, but we just know how to use it, as if walking in chains, which obviously does not meet the quality of a qualified programmer. Therefore, in this article, we will dig deep into it and explore the secrets behind it. 1. Fancy mapping In the actual development, the entity class in the pro ...

Posted on Sat, 23 May 2020 06:04:55 -0400 by Zeon

How does Stream in Java work?Case Details

Be careful: Stream does not store elements by itself. Stream does not change the source object.Instead, it returns a new Stream with the result Stream operations are delayed, meaning they will not execute until a result is needed.(Delayed Loading)Additionally, note that you will inevitably encounter a variety of problems during your advanced ...

Posted on Sat, 23 May 2020 02:27:51 -0400 by Skor

Several examples of loops in oracle

Several examples of loops in oracle Several examples of loops in oracle GOTO Usage FOR loop usage WHILE Cycle Usage LOOP Cycle Usage Advanced Usage 1 Traverse cursors with LOOP loops Advanced Usage II FOR Traversal Cursor Advanced Usage Three WHILE Traversal Cursor GOTO Usage DECLARE x NUMBER; BEGIN ...

Posted on Fri, 22 May 2020 12:41:29 -0400 by e11even

Summary of Solr's Study I

Heart Word: Because relational databases have always been in contact with before, all of these nosql s do not fit in very well.It is often used in companies.This is not difficult to learn, but for future review.I decided to write down some of the skills and experiences I learned Environment Configuration for Solr This is a lot of online st ...

Posted on Fri, 22 May 2020 12:19:56 -0400 by potatoCode

Talk about the ElapsedTimeStrategy of debezium

order This paper mainly studies the ElapsedTimeStrategy of debezium ElapsedTimeStrategy debezium-v1.1.1.Final/debezium-core/src/main/java/io/debezium/util/ElapsedTimeStrategy.java @FunctionalInterface public interface ElapsedTimeStrategy { /** * Determine if the time period has elapsed since this method was last called. * * ...

Posted on Fri, 22 May 2020 10:23:47 -0400 by pjsteinfort

BitArray is good, but don't abuse it. Another online memory boom

One: Background 1. Storytelling Last month I wrote a blog about using bitmap to compress the original List <CustomerID>with high intensity, which compresses the original List memory nearly 106 times, but bitmap is not always good. You must make it in the right scene.Instead of abusing with closed eyes, the corresponding set of bitmaps in ...

Posted on Thu, 21 May 2020 20:59:50 -0400 by ealderton

Noip2017 improves D1T2 time complexity

I didn't mean to brush the outrageous network flow today and finally filled in this mass grave   First of all, we know that this is a simulation problem. Then, this is a simulation to be judged wrong. Finally, this is a simulation problem of data diversification. 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cstring> ...

Posted on Thu, 21 May 2020 10:46:38 -0400 by archbeta

The use and principle analysis of BufferedInputStream

We usually read files. For example, using FileInputStream to read files is inefficient. Therefore, we can use BufferedInputStream to read files. The efficiency of reading files will be greatly improved. Here we introduce how to use BufferedInputStream and analyze its working principle 1, Introduction to use: 1.1 definition: BufferedInputStre ...

Posted on Thu, 21 May 2020 04:14:08 -0400 by godster

Divide and conquer policy - choose k th largest number - Java implementation

Title requirements: Write a program that outputs the k th largest number of different integers for any input Resolution: We solve this problem by dividing and conquering. Put these numbers in an array, and with divide and conquer, we can think of how to divide and conquer them. By dividing an array into subarrays of equal size, and then tak ...

Posted on Wed, 20 May 2020 20:15:46 -0400 by robindean