TY  - JOUR
T1  - Binary Insertion Sort: A Modified Way of Sorting
AU - , Md. Mosaddik Hasan AU - , Md. Sazzad Hossain AU - , Shib Nath Datta AU - , Md. Abu Yousuf 
JO  - Asian Journal of Information Technology
VL  - 5
IS  - 7
SP  - 678
EP  - 680
PY  - 2006
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2006.678.680
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2006.678.680
KW  - Binary search
KW  -insertion sort
KW  -quick sort
KW  -merge sort
KW  -heap sort
KW  -divide and conquer
AB  - This study presents a technique for sorting data in an efficient way. The number of comparisons of the proposed algorithm is less then the existing algorithm and it does not require extra memory space. So this algorithm is very suitable for sorting large number of data item. For general case when we need to sort all the data that means when all the data is newly inserted then our algorithm is better than any other existing algorithm and when some data is inserted to a large amount of sorted data (e.g. voter management system or central database system in a country) then our algorithm is very much better than the existing algorithms.
ER  -