Asian Journal of Information Technology

105
Views

1
Downloads

Binary Insertion Sort: A Modified Way of Sorting

Md. Mosaddik Hasan , Md. Sazzad Hossain , Shib Nath Datta and Md. Abu Yousuf
Page: 678-680 | Received 21 Sep 2022, Published online: 21 Sep 2022

By Research Area

Medicine & Public Health Life Sciences Engineering Mathematics Biomedicine Physics Chemistry Computer Science Earth Sciences Social Sciences Business and Management Psychology Materials Science Economics Education Environment Philosophy Statistics Law Political Science and International Relations Pharmacy Dentistry Energy Linguistics Geography Finance Criminology and Criminal Justice Medicine Cultural and Media Studies History Architecture / Design Literature Biomedical Sciences Religious Studies Education & Language Food Science & Nutrition Public Health

By Volume and Issue

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.

How to cite this article:

Md. Mosaddik Hasan , Md. Sazzad Hossain , Shib Nath Datta and Md. Abu Yousuf . Binary Insertion Sort: A Modified Way of Sorting.
DOI: https://doi.org/10.36478/ajit.2006.678.680
URL: https://www.makhillpublications.co/view-article/1682-3915/ajit.2006.678.680