Proposal of a New Sorting Algorithm

Summary - Calculation problems affect early civilization. These problems and solutions are used to study the universe. Numbers and symbols have been used in various fields such as mathematics and statistics. When the computer is displayed, you need to sort the numbers and objects in a specific order (ascending and descending). The order of these numbers is often called sorting. Sorting has become increasingly important in computer science, and its use is in file systems and so on.

We proposed a new consensus algorithm based on "real number" - ε - differential protocol (EDA). EDA provides a parallel sort algorithm to large nodes and agrees with the order. Preliminary results indicate that consensus performance increases linearly with the number of nodes. The theoretical significance behind the design is extensive, directly solving the scalability problems encountered by other block chains and converting them from weak points to pros and cons. However, this is a successful execution of the project and the key ability of the team to provide functional products, given that the goal is a difficult task.

Since the new algorithm is Herman's proposal, it is a proposal of Herman (Random Hashing) which solves the mining problem and writes the theory part. Therefore, I prefer that he is the first person to implement and discuss the new algorithm. We need to do thorough analysis if it can be done and any inconvenience that we may face or inconvenience. I am a supporter, but I do not want to predict the date, as I need a more detailed analysis.

In this series, I saw two ways to design algorithms. One of the names we know: divide and conquer algorithm. When we first introduced the merge sort algorithm, we learned to divide and conquer. The algorithm of divide and conquer method reminds me of dividing the problem into simpler versions and then applying the same solution to the larger problem itself as we use for smaller subproblems. When learning about merge sorting, remember how the algorithm combines answers and its subproblems and how to merge and sort elements using recursion. This is also a feature of the d & c algorithm.