Fastbit-radix sort: Optimized version of radix sort

Sorting is applied in daily life from ordering simple lists to real world applications. Sorting presents the data in an ordered fashion which helps in analysis or allows computing data faster. Radix sort is a non-comparative integer sorting algorithm that sorts in a linear time complexity. Radix sort performs modulus operation on each data to extract the digits at a specific position and maintain count table, based on this table it sorts the data. It is observed that computing at a bit level is faster than performing arithmetic operation to the values. It is essential to optimize the computation time of this sorting algorithm as it has a linear time complexity. This paper aims to optimize radix sort by performing bitwise operations in contrast to the normal integer division.