Sorting is a technique which is used to arrange the data in specific order. A sorting technique is applied to rearrange the elements in numerical order as ascending order or descending order or for words in alphabetical order. In this paper, we propose an efficient sorting algorithm known as Enhanced Bidirectional Insertion Sorting algorithm which is developed from insertion sort concept. A comparative analysis is done for the proposed Enhanced Bidirectional Insertion Sort algorithm with the selection sort and insertion sort algorithms. When compared to insertion sort algorithm the proposed algorithm outperforms with less number of comparisons in worst case and average case computing time. The proposed algorithm works efficiently for duplicated elements which is the advanced improvement and the results are proved.