ARTICLE

The Performances of Sorting Algorithms by Using Assembly Language

Victor Deian Balutoiu, Liviu Octavian Mafteiu-Scai


© 2024 Liviu Octavian Mafteiu-Scai, published by UIKTEN. This work is licensed under the Creative Commons Attribution-NonCommercial 4.0 International. (CC BY-NC 4.0).

Citation Information: SAR Journal. Volume 7, Issue 2, Pages 70-75, ISSN 2619-9955, https://doi.org/10.18421/SAR72-02, June 2024.

Received: 10 May 2024.
Revised:   14 June 2024.
Accepted: 20 June 2024.
Published: 28 June 2024.

Abstract:

In many programs the data have to be sorted according to one or more criteria. Algorithmics offers us specific algorithms classified according to the order of complexity. But from this point to the realization of a concrete and efficient program for a specific set of data there is a long way. The choice between performance and flexibility of an application is not easy. This paper presents an experimental study that tracks the time performance of assembly language implementations in relation to C and Rust in cases of Bubble Sort, Insertion Sort and Quick Sort algorithms. Conclusions as well as future research directions are also included.


Keywords – bubble sort, insertion sort, quick sort, assembly language, C/C++, rust, runtime.

                   

                                                                      Full text PDF