CHARACTERISTICS OF SORTING ALGORITHMS OPERATION IN PYTHON

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.