Visualization of performance of binary search in worst case in personal computer using scatter plot, interpolation lines and loess curve

Abstract

From ancient time people have a great deal of inquisitiveness in different aspects of life. In every point of time we generate a great amount of data but crystallizing these data first into information, then from information to knowledge and ultimately into wisdom are undoubtedly one of the biggest challenges in front of us. One way to extract information hidden within the data is to identify the pattern of the data. The technique of data visualization helps us to easily identify the patterns hidden within the dataset. In the present study, the researchers have examined the performance (Data size versus Average execution time) of Binary search in the worst case by experimental means and the main objectives are to visualize the performance using scatter plot, interpolation lines and Loess curves. The scatter plot of the performance appears to be approximately random and the interpolation lines appear to be going zig-zag way. An approximately smooth Loess curve is fitted to the data points using Gaussian family with span is equal to 0.6, degree is equal to 2 and residual standard error is equal to 29.04.