Comparison and proof of the fastest way of the sorting algorithm by functional programming in Erlang
Abbas Jkhayyir Kadhim · AIP conference proceedings · 2022
Typically, refactoring are expressed in high-level, general purpose programming languages, which are impractical to verify because they are too complex to have tractable formal semantics definitions. Refactoring can be defined in various formats at various abstraction levels, the sorting algorithm is the most important and powerful in most or all programs language and database, the mighty importance of the sorting towards data mining that needs ordered the datasets elements to be fast particularly in preprocessing data. Methods : The challenges side incur of this paper summed up development the sort algorithm many times, using different refactoring ways as sequentially method sometimes with list comprehension moreover recursive listing, further with parallel computing, Implementation and execute different methods for the sorting algorithm code on several different computers with different in CPU to achieve the best rate of pure results for implementation under the Erlang code. Proposed solution : The purpose of this paper is to conduct a comparison between methods by evaluate the runtime execution prepared code that writing under Erlang functional programming, the research effort comparative analysis between the approaches adopted many member of the sort algorithm and proposed a new technique that works ordered the list by minimum elements with recursive the list comprehensive. Result: then this paper will a prove the Quick Sort technique is the fastest compared with the others.