Desempenho de algoritmos clássicos em diferentes linguagens de programação

Abstract

The work consists of analyzing three simple sorting algorithms: Bubble Sort, Selection Sort, and Insertion Sort. An empirical analysis of the performance of these algorithms will be conducted, focusing on the movements and exchanges during the sorting process for the Selection Sort and Insertion Sort algorithms, while for Bubble Sort, only an analysis regarding processing time will be performed. The main objective of this analysis is to achieve an understanding of the average performance of the algorithms, using the array data structure, with a sampling between 39 and 52 samples, in three different programming languages: Mathematical Logic, Programming, and Computer Languages. The aim is to determine the performance of the algorithms in these three scenarios and to estimate, through polynomial regression, the correlation between the variables and obtain a function close to the asymptotic functional class to which the algorithm belongs.