Figure 6 represents the performance gain by the claimed improvement. Both the linear search and binary search versions are included in the comparison. The binary insertion sort uses the least time to find the proper location of the data item to be inserted and spends most of the time to shift other data items. Hence, the enhancement effect of the proposed algorithm on the binary insertion sort is larger than the linear search version, which is evident from the result. Moreover, the enhancement of the linear search version makes it almost equal efficient as the binary insertion sort.