ALGORITHM EFFICIENCY, A SIDE-BY-SIDE COMPARISON

Radu-Mihail Ciuperca (), Vlad-Andrei Mihai () and Daniela Alexandra Crisan ()
Additional contact information
Radu-Mihail Ciuperca: BearingPoint, Romania
Vlad-Andrei Mihai: StarByte, Romania
Daniela Alexandra Crisan: Romanian-American University, Romania

Journal of Information Systems & Operations Management, 2023, vol. 17, issue 2, 77-94

Abstract: This study presents a comparative analysis of the efficiency of classic sorting algorithms, including Merge Sort, Quick Sort, Heap Sort, Bubble Sort, Selection Sort, Counting Sort and the enigmatic Bogo Sort. Through a series of rigorous tests on arrays of varying sizes, we measured the time complexities of each algorithm and examined their performance characteristics. Our findings reveal distinctive patterns in the behavior of these algorithms, highlighting their relative strengths and limitations in handling different data structures. By evaluating factors such as time complexity, stability, and adaptability, we provide insights that aid in the informed selection of sorting methodologies for diverse computational challenges. This study contributes to a nuanced understanding of algorithmic efficiency and provides valuable guidance for practical implementation in real-world applications.

Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.rebe.rau.ro/RePEc/rau/jisomg/WI23/JISOM-WI23-A05.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rau:jisomg:v:17:y:2023:i:2:p:77-94

Access Statistics for this article

More articles in Journal of Information Systems & Operations Management from Romanian-American University Contact information at EDIRC.
Bibliographic data for series maintained by Alex Tabusca ().