InfluxDB empowers developers to build IoT, analytics and monitoring software. It is purpose-built to handle the massive volumes and countless sources of time-stamped data produced by sensors, applications and infrastructure.

Install GVM

bash < <(curl -s -S -L

Select the appropriate GO version

gvm install go1.13 
go version

Prepare the source directory

mkdir $HOME/gocodez 
export GOPATH=$HOME/gocodez

Get the InfluxDB codes

go get 
cd $GOPATH/src/
git checkout v1.8.9

Build the InfluxDB codes

go install -ldflags="-X main.version=1.8.9 -X main.branch=main -X main.commit=d9b56321d5796d7791138ed6a8f0a6ae6007a551" ./...

Originally published at

NMIG is an app, intended to make a process of migration from MySQL to PostgreSQL as easy and smooth as possible. It has been written in the TypeScript language and is run on Node.js 10 or higher.

Visit the link for more information:


Download and install Node.js 10 or…

If you have been handed a .phd file which is a dump of the heap of an IBM Java virtual machine, you can analyse it using the Eclipse Memory Analyzer Tool (MAT), but you must install the IBM Monitoring and Diagnostic Tools first.

Download MAT from:

I suggest the…

pgloader can be installed in different ways, so this article describes only one way, how to compile and install on the linux ppc64le platform.

Installation of the SBCL (Steel Bank Common Lisp)

There are binaries for the platform (1.5.8 is the latest current version), but the problem is that threads support is disabled by default, so we will…

In mathematics, the factorial of a positive integer n, denoted by n!, is the product of all positive integers less than or equal to n: n!=n*(n-1)(n-2)… For example: 5! = 5 * 4 * 3 * 2 * 1 = 120. The value of 0! …

In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the…

In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.


  • A linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list.

Time complexity

Worst-case performance: O(n)
Best-case performance: O(1)
Average performance: O(n)
Worst-case space complexity: O(1) iterative


final class LinearSearch {

static int search(final int[] in, final int value) {
for (var i = 0; i < in.length; i++) {
if (in[i] == value) {
return i;

return -1;


Source Code

Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, a generalization…

In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix. For elements with more than one significant digit, this bucketing process is repeated for each digit, while preserving the ordering of the prior step, until all…

In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct key value, and using arithmetic on those counts to…

Andrey Karazhev

Software Engineer

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store