  The present paper examines the behavior of Shift-insertion sort (insertion
sort with shifting) for normal distribution inputs and is in continuation of
our earlier work on this new algorithm for discrete distribution inputs,
namely, negative binomial. Shift insertion sort is found more sensitive for
main effects but not for all interaction effects compared to conventional
insertion sort.
