10 algorithms with the greatest impact summarized by 199bit

1. Merge sort, quick sort, and Heap Sort)

 

Which sort algorithm has the highest efficiency? This depends on the situation. This is why I put the three algorithms together. You may be more familiar with one of them, but they have their own merits.

The Merge Sorting Algorithm is one of the most important algorithms so far. It is a typical application of the division and control method. It was invented by the mathematician John von norann in 1945.

The quick sorting algorithm combines the set partitioning algorithm and the grouping algorithm, which is not very stable, but has a high aging rate when dealing with random arrays (Am-based arrays.

Stacked sorting uses the priority queue mechanism to reduce the search time during sorting, which is also not very stable.

Compared with earlier sorting algorithms (such as bubble algorithms), these algorithms put the sorting algorithms on a large scale. Thanks to these algorithms, today's data mining, AI, link analysis, and most Web computing tools are available.

2. Fourier transformation and Fast Fourier Transformation

These two algorithms are simple but powerful, and they are indispensable in the entire digital world. Their function is to convert Time and Frequency functions. This article is also a blessing for these algorithms.

Almost all computer-related devices such as the Internet, WiFi, smart phones, landlines, computers, routers, and satellites are more or less related to them. Without these two algorithms, you cannot obtain a degree in electronics, computer, or communication engineering. (USA)

3. Dijkstra's Algorithm)

It can be said that without such an algorithm, the Internet will certainly not be as efficient as it is now. You can use this algorithm to find the shortest distance between two nodes in the graph as long as the problem is represented by the "Graph" model.

Although there are many better ways to solve the shortest path problem, the stability of the daikto algorithm cannot be replaced.

4. RSA asymmetric encryption algorithm

 

It is no exaggeration to say that without the contribution of this algorithm to key learning and network security, the status of the Internet today may not be so high. The current network is insecure, but we must ensure sufficient security when we encounter money-related problems. If you think the network is insecure, it is certainly not silly to enter your bank card information on the webpage.

The RSA algorithm, one of the best algorithms in the key science field, was proposed by three founders of RSA and laid the foundation for key research today. The problem solved with this algorithm is simple and complex: how to share keys between independent platforms and users while ensuring security.

5. Secure Hash Algorithm)

Specifically, this is not an algorithm, but an encryption hash function, first proposed by the National Institute of Standards and Technology. Whether it is your app store, email, anti-virus software, or browser, you can use this algorithm to ensure normal download, whether it is "man-in-the-middle attack", or "phishing ".

6. integer factorization)

This is actually a mathematical algorithm, but it has been widely used in the computer field. Without this algorithm, the encrypted information will not be so secure. Through a series of steps, it can divide a synthetic number into a number factor that cannot be further divided.

Many encryption protocols use this algorithm, such as the mentioned RSA algorithm.

7. Link Analysis Algorithm)

 

In the Internet era, the analysis of relations between different portals is crucial. From search engines and social networking websites to market analysis tools, we have spared no efforts to find the correct structure of the Internet.

The link analysis algorithm has always been one of the most confusing algorithms in this field. The implementation methods are different, and its own characteristics make the algorithms of each implementation method different, but the basic principles are similar.

The mechanism of the Link Analysis Algorithm is actually very simple: you can use a matrix to represent a "Graph" to form a feature value problem. This feature helps you analyze the structure of the graph and the weights of each node. This algorithm was proposed by Gabriel Pinski and Francis Narin in 1976.

Who will use this algorithm? Google's webpage ranking: when Facebook sends you information streams (so the information stream is not an algorithm, but an algorithm result), the friend recommendation function of Google + and Facebook, and the work recommendation of LinkedIn, video recommendations for YouTube, etc.

Google is generally considered to be the first institution to use such algorithms, but this idea was used by the "rankdex" small search engine created by Li Yanhong two years ago in 1996. The hyper search algorithm builder, Momo maqioli, used similar algorithms. Both of them became legends in Google's history.

8. Proportional calculus algorithm (proportional integral derivative algorithm)

 

This algorithm is used in aircraft, automobiles, televisions, mobile phones, satellites, factories, robots, and other things.

To put it simply, this algorithm uses the "control loop feedback mechanism" to reduce the error between the preset output signal and the real output signal. This calculation method is required as long as signal processing or electronic systems are required to control automation machinery, hydraulic pressure, and heating systems.

Without it, there will be no modern civilization.

9. Data Compression Algorithm

Which of the following are the best data compression algorithms? This depends on the application direction, compression MP3, JPEG and MPEG-2 files are not the same.

Where can I see them? It is not just a compressed file in a folder. The webpage you are reading uses a Data Compression Algorithm to download information to your computer. In addition to text, games, videos, music, data storage, cloud computing, and so on. It makes various systems easier and more efficient.

10. Random Number Generation Algorithm

Until now, the computer has no way to generate a "positive" random number, but the pseudo-random number generation algorithm is enough. These algorithms are applied in many fields, such as network connection, encryption technology, secure hashing algorithm, online games, AI, and conditional initialization in problem analysis.