Performance Visualization of Gnome Sort in Worst Case Implemented Using R in Three Personal ComputersD

Abstract

Aim: To visualize the performances of the Gnome sort in the worst case in three different personal computers and to identify through visual inspection whether the performances of the Gnome Sort in the worst case follows quadratic nature or not. Methodology: The Gnome sort algorithm is implemented using R. For the purpose of the study, the researchers have used three (3) different personal computers having different configurations. The entire experiment have been carried out for data size one hundred (100) to data size two thousand (2000) with an interval of one hundred (100). The performances (data size versus average run time in seconds) of Gnome sort algorithm in the worst case in all the three personal computers are visualized using scatter plots and quadratic curves. Results: The performances of Gnome sort in the worst case implemented using R in all the three personal computers under study shows similar patterns which are very close to quadratic curves. Conclusion: From the study using visual inspections, we may conclude that the performances of Gnome sort in the worst case in all the three (3) cases are approximately following quadratic nature.