Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort

TL;DR

This paper introduces Bidirectional Conditional Insertion Sort (BCIS), an in-place sorting algorithm that outperforms classical insertion sort and Quicksort for small arrays and arrays with many duplicates.

Contribution

The paper presents BCIS, a novel in-place sorting algorithm with improved average-case performance over classical insertion sort and Quicksort in specific scenarios.

Findings

BCIS is faster than classical insertion sort for small arrays.

BCIS outperforms Quicksort for arrays up to 1500 elements.

BCIS is more efficient with high duplicate rates, even for large arrays.

Abstract

In this paper, we proposed a new efficient sorting algorithm based on insertion sort concept. The proposed algorithm called Bidirectional Conditional Insertion Sort (BCIS). It is in-place sorting algorithm and it has remarkably efficient average case time complexity when compared with classical insertion sort (IS). By comparing our new proposed algorithm with the Quicksort algorithm, BCIS indicated faster average case time for relatively small size arrays up to 1500 elements. Furthermore, BCIS was observed to be faster than Quicksort within high rate of duplicated elements even for large size array.