How does the Shift-insertion sort behave when the sorting elements follow a Normal distribution?

TL;DR

This paper investigates the performance of Shift-insertion sort on normally distributed data, highlighting its sensitivity to main effects and comparing it to traditional insertion sort.

Contribution

It extends previous research by analyzing Shift-insertion sort's behavior with continuous normal distribution inputs, a novel focus for this algorithm.

Findings

More sensitive to main effects than conventional insertion sort

Behavior differs for interaction effects

Provides insights into algorithm performance with normal data

Abstract

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.