Performance visualization of bubble sort in worst case using R programming in personal computer

Abstract

The present work attempts to perform a visual analysis of the performance of Bubble sort in the worst case in a personal computer (laptop). The said algorithm is implemented using R programming language and the run time of the Bubble sort in the worst case for the data size under study have been recorded. For the purpose of the study, 100 observations for each data size are recorded. For each data size, the researchers have calculated four measures namely minimum time, maximum time, average time and median time. These four measures are visualized using scatter plots and line charts and they are also visually compared with quadratic curves. It has been observed that the performances of Bubble sort in all the four cases are approximately similar and approximately follows the quadratic curves.