Abstract
The purpose of the study is to compare the efficiency of popular programming languages using the time characteristics of sorting algorithms as an example. Sorting algorithms were chosen due to the high frequency of their use as auxiliary algorithms in solving various problems, for example, in the implementation of binary search. Since sorting algorithms are labor-intensive, the speed of their implementation, in turn, is critical for evaluating the effectiveness of many projects, as well as when evaluating the choice of one or another programming language. The present article is a comparison in the time characteristics of the implementation of common sorting algorithms in various high-level programming languages. The results of the experimental study allow drawing conclusions about the expediency of using certain programming languages in the problems of sorting implementation, depending on the existing time constraints. The running time of sorts in most programming languages is highly dependent on the way the problem is solved, and different ways may be more efficient in different languages, and some solutions that seem very effective at first glance can lead to an unexpected slowdown of the program. At the same time, the Lisp and Lua programming languages optimize the code qualitatively and allow achieving the maximum speed.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
