This article presents a comparative analysis of the performance efficiency of sorting algorithms — quicksort, merge sort and heapsort — on large-scale datasets. Experimental measurements were carried out for the studied algorithms in the Python programming environment: the execution time, memory consumption and recursion depth were measured on random, sorted and reversesorted arrays. The results are presented in the form of diagrams and tables.