Comparative analysis of sorting algorithms: Timsort python and classical sorting methods

Wibowo, Firmansyah Rekso and Faisal, Muhammad ORCID: https://orcid.org/0000-0003-4884-7254 (2024) Comparative analysis of sorting algorithms: Timsort python and classical sorting methods. JISA (Jurnal Informatika dan Sains), 7 (1). pp. 11-18. ISSN 2776-3234

Text 20187.pdf - Published Version Available under License Creative Commons Attribution Share Alike. Download (1MB)

Abstract

The sorted() function within the Python programming language has emerged as the primary choice among developers for sorting operations. Consequently, this study offers a comparative analysis of various classical sorting algorithms and Python's built-in sorting mechanisms, with the objective of identifying the most time-efficient sorting algorithm. The analysis involves assessing the time complexity of each algorithm while handling data arrays ranging from 10 to 1,000,000 elements using Python. These arrays are populated with randomly generated numeric values falling within the range of 1 to 1000. The benchmark algorithms utilized encompass Heap Sort, Shell Sort, Quick Sort, and Merge Sort. A looping mechanism is applied to each algorithm, and their execution speeds are gauged utilizing the Python 'time.perf_counter()' library. The findings of this study collectively indicate that Python's standard algorithm, surpasses classic sorting algorithms, including Heapsort, Shellsort, Quicksort, and Mergesort, in terms of execution

Item Type:	Journal Article
Keywords:	Quicksort; Mergesort; Timsort; Heapsort; Shellsort
Subjects:	08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080201 Analysis of Algorithms and Complexity
Divisions:	Graduate Schools > Magister Programme > Graduate School of Informatics Engineering
Depositing User:	Muhammad Faisal
Date Deposited:	26 Aug 2024 08:42

Downloads

Origin of downloads

Actions (login required)

View Item