If you do not find what you're looking for, you can use more accurate words.
Traditional insertion sort algorithms are strictly unidirectional, processing elements sequentially from i=0 to n-1. This paper introduces a symmetric processing model that handles both the lower and upper bounds of the unsorted sub array simultaneously. By shrinking the unsorted range from both sides, the algorithm optimizes the locality of reference and provides a new perspective on in-place sorting stability.