Authors : Md. Mosaddik Hasan , Md. Sazzad Hossain , Shib Nath Datta and Md. Abu Yousuf
Abstract: 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.
Md. Mosaddik Hasan , Md. Sazzad Hossain , Shib Nath Datta and Md. Abu Yousuf , 2006. Binary Insertion Sort: A Modified Way of Sorting. Asian Journal of Information Technology, 5: 678-680.