What question did this study set out to answer?

The aim is to analyze various sorting algorithms in Python and Cython, focusing on their effectiveness and localization challenges.

April 8, 2026Open Access

Characteristics of Sorting Algorithms Operation in Python

KVKyrychenko Viktor KAKhomenko Andrii

Key Points

The aim is to analyze various sorting algorithms in Python and Cython, focusing on their effectiveness and localization challenges.
Comparison of classic sorting algorithms including bubble sort, insertion sort, and quicksort.
Examination of localization issues for non-English string sorting, specifically for the Ukrainian alphabet.
Utilization of performance measurement techniques and visualization of results using graphs.
Discovery of performance differences between sorting algorithms based on dataset sizes.
Identification of challenges in accurately sorting non-English strings using specialized dictionaries.
Visualizations provided insights into the scaling behavior of each sorting method.

Abstract

This article is dedicated to the analysis of various sorting algorithms using the Python programming language and sorting algorithms in Cython. The study compares classic sorting methods, such as bubble sort, insertion sort, and quicksort, with the aim of determining their effectiveness for large datasets. Special attention is given to localization issues when sorting strings in non-English languages, particularly, the application of a specialized dictionary for the correct processing of the Ukrainian alphabet. Techniques for measuring performance and visualizing results in the form of graphs are presented, allowing a deeper assessment of the scaling of each algorithm depending on the dataset size.

Demander à l'IA

Bookmark

View Full Paper