Binary Divide By 3

Algorithm one: Fast sorting algorithm is a sort algorithm developed by Donny Holl. In average, sort n items to be 0 (n log n) times compared. In the worst-case scenario, 0 (N2) comparisons are required, but this is not a common situation. 　　In fact, fast sorting is typically faster than the other 0 (n log n) algorithms because its internal loops (inner Loop) can be implemented efficiently on most architectures. Quick sort using divide-and-conquer method (http://www ...)

The sorting algorithm can be divided into internal sorting and external sorting. The internal sorting is to sort the data records in the memory, while the external sorting is because the sorting data is very large, so it can not hold all the sorting records at a time. In the sorting process, it needs to access the external memory. Common internal sorting algorithms are: Insert sort, Hill sort, Select sort, Bubble sort, Merge sort, Quick sort, Heap sort, Base sort and so on. This article will introduce the above eight sorting algorithm in turn. Algorithm 1: insert sort Insert sort diagram Insert sort is one of the most simple and intuitive sorting algorithm, it's work ...

The scalability of the system is the main reason for promoting the development of NoSQL movement, including distributed system coordination, failover, resource management and many other features. That makes NoSQL sound like a big basket that can be stuffed with anything. Although the NoSQL movement does not bring fundamental technological changes to distributed data processing, it still leads to extensive research and practice on protocols and algorithms. It is through these attempts to gradually summarize some effective database construction methods. In this article, I will focus on the NoSQL database distributed special ...

The scalability of the system is the main reason for promoting the development of NoSQL movement, including distributed system coordination, failover, resource management and many other features. That makes NoSQL sound like a big basket that can be stuffed with anything. Although the NoSQL movement does not bring fundamental technological changes to distributed data processing, it still leads to extensive research and practice on protocols and algorithms. It is through these attempts to gradually summarize some effective database construction methods. In this article, I will focus on the distributed features of the NoSQL database ...

The algorithm "trains" in some way by using known inputs and outputs to respond to specific inputs. It represents a systematic approach to describing the strategic mechanisms for solving problems.

There are quite a lot of routines for machine learning, but if you have the right path and method, you still have a lot to follow. Here I recommend this blog from SAS's Li Hui, which explains how to choose machine learning.

Recently a series of pre-sales demos of Microsoft Virtualization Solutions in fact, for most customers will not be a complete set of "relatively perfect" program in the first time to see very in-depth, but usually more care about some of the most basic functions and configuration options, especially the technical post people will often have "preconceived" mood, This is normal, assuming that the customer is using n years of VMware or that he is a Si jie powder, then you have a Microsoft environment to speak to others, the other party will ask some Hyper-V ...

1. Given a, b two files, each store 5 billion URLs, each URL accounted for 64 bytes, memory limit is 4G, let you find a, b file common URL? Scenario 1: The size of each file can be estimated to be 50gx64=320g, far larger than the memory limit of 4G. So it is not possible to fully load it into memory processing. 　　Consider adopting a divide-and-conquer approach. s traverses file A, asks for each URL, and then stores the URL to 1000 small files (recorded) based on the values obtained. This ...

With the development of bio-computer technology, more and more new types of storage media are coming into our sight. In 2007, Japanese scientists successfully used bacterial DNA to store data for millennia; we've also introduced crabs to computers and the use of bacteria to make hard drives, the idea of which is quite sci-fi. Recently, biological engineers and geneticists at the Harvard Institute of Harvard's Wyss Cato have successfully developed a new technology that can store about 700TB of data into 1 grams of DNA before using Dnah ...

First of all, to deal with big data interview questions, some basic concepts should be clear