The Performances of Sorting Algorithms by Using Assembly Language
The Performances of Sorting Algorithms by Using Assembly Language
Author(s): Victor Deian Balutoiu, Liviu Octavian Mafteiu-ScaiSubject(s): Information Architecture, Electronic information storage and retrieval
Published by: UIKTEN - Association for Information Communication Technology Education and Science
Keywords: bubble sort; insertion sort; quick sort; assembly language; C/C++; rust; runtime
Summary/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.
Journal: SAR Journal - Science and Research
- Issue Year: 7/2024
- Issue No: 2
- Page Range: 70-75
- Page Count: 6
- Language: English
