%0 Journal Article
%T Analyzing Singleton Sort Through Computer Experiments for Normal Inputs
%J Algorithms Research
%@ 2324-996X
%D 2012
%I 
%R 10.5923/j.algorithms.20120103.01
%X The present work aims to study the behavior of singleton sort algorithm for normal distribution inputs with a focus on parameterized complexity. Statistical bound estimates are obtained by running computer experiments working directly on time. It is found, using factorial experiments, that the parameters of normal distribution ( mean and standard deviation) along with the input size are all significant statistically both individually as well as interactively.
%K Singleton Sort
%K Parameterized Complexity
%K Factorial Experiments
%K Computer Experiments
%K Average Complexity
%U http://article.sapub.org/10.5923.j.algorithms.20120103.01.html