Summary of Classical Sorting

Bubble sorting (stable) Compare the two adjacent elements in turn, and change the big ones to the back. The result of a cycle is that the largest number is at the end. Repeat the above steps (except the last one) until you have finished. Average time complexity: O (n^2) Optimal time complexity: O(n) v ...

Posted on Mon, 05 Aug 2019 22:45:29 -0700 by ec

The Specific Time for Link List of HashMap Underlying Data Structure to Turn Red-Black Tree

Preface This paper explores the specific time when HashMap's linked list turns to red-black tree from three parts: 1. Statement on the threshold of "Link List to Red-Black Tree" in HashMap;2. Parse the source code of HashMap.put(K key, V value);3. Testing; First, from the statement of HashMap about the threshold value of "link ...

Posted on Mon, 05 Aug 2019 20:37:33 -0700 by kof20012

Using Median Filtering to Filter Outlier Data

Original Link: http://www.cnblogs.com/haoxinyue/p/3307044.html Recently, there was a program that needed to do some data analysis and met a need to average.The data sequence output from the sensor is similar to the following: [10,12,11, ...

Posted on Mon, 05 Aug 2019 16:49:23 -0700 by bickyz

Preliminary Exploration of Libra's Move Language, 10 Lines of Code to Realize Your First Intelligent Contract

In the blog of the last few days, the author introduced the relevant issues. libra environment construction as well as The Method of Transaction through client . Today, I will continue to introduce to you the scheme of writing intelligent contracts in mobile language. The main features of mobile la ...

Posted on Mon, 05 Aug 2019 03:38:43 -0700 by StateGuy

Javascript Data Structure and Algorithms--Binary Tree

Original address: http://www.brandhuang.com/article/1564967352592 1. Trees Topmost node of a tree: root node Multiple nodes are connected under one node, which is called the parent node, the node below it is called the child node, and the node without any child node is called the leaf node. A node can have more than one child node 2. Binary Tre ...

Posted on Sun, 04 Aug 2019 19:11:32 -0700 by tripleM

Database System SSD7 Experiment 4 Trigger and Cursor

Experiment 4 Triggers and Cursors I. Experimental Purpose _Familiar with the method of database integrity control by SQL statement, understand the concept, definition method and trigger condition of trigger. Understand how cursors are defined, opened, used, closed and released. II. EXPERIMENTAL CO ...

Posted on Sun, 04 Aug 2019 05:08:35 -0700 by jkatcher

OpenGL Introduction 8: Camera

This is a personal learning record, learning suggestions to see the tutorial https://learnopengl-cn.github.io/ Thank you very much to the original author Joey DeVries and many excellent tutorials for Chinese translators. Recent developments Preface We already know what observation matrices are and how to use them to move scenarios (we moved a l ...

Posted on Sat, 03 Aug 2019 08:48:52 -0700 by vickyjackson

Source code analysis of leveldb Arena

Preface Memory usage is very important for a high performance server program. C++ provides new/delete to manage memory application and release, but for small objects, the direct use of new/delete costs a lot, requires extra space and time, and the cost-effective ratio is not high. In addition, memory fragmentation caused by multiple applicatio ...

Posted on Sat, 03 Aug 2019 02:42:11 -0700 by arnihr

CodeForces 527C. Glass Carving (SBT, Segment Tree, set, Maximum Continuous 0)

Origin address: http://codeforces.com/problemset/problem/527/C   Examples input 4 3 4 H 2 V 2 V 3 V 1 output 8 4 4 2 input 7 6 5 H 4 V 3 V 5 H 2 V 1 output 28 16 12 6 4   Given a rectangle, cut longitudinally or horizontally, ask what is the maximum rectangular area after each cut. Maximum rectang ...

Posted on Fri, 02 Aug 2019 01:42:16 -0700 by Stressed

Netty memory pool and allocation of hit cache

Memory specifications for memory pools: In the previous source code analysis process, we should have some impressions about the size of memory specifications. In fact, there are four main sizes of memory in Netty memory pool: tiny refers to the size between 0-512Byte, small refers to the size between 512Byte-8KB, normal refers to the size betw ...

Posted on Thu, 01 Aug 2019 21:48:03 -0700 by RogerInHawaii