An Efficient Sorting Algorithm for binary data

In this era of fast technological advancement, managing data is a major problem in the field of computer science. Many algorithms are developed to handle this task in which sorting of data is a basic requirement. Sorting of data is nothing but arranging a random set of data elements into sequential ascending/descending order. In this paper, we proposed an efficient sorting algorithm named bin_sort which is a short form of binary sorting. Bin_sort considers the binary version of the data elements to sort the data as its name indicates. Bin_sort performs an iterative recursive operation in time complexity of O(n log
₂
n) to perform the sort operation on the data, which clearly indicates bin_sort is more efficient for binary data and on large input dataset than most of the existing sorting algorithms.