Radix Plus Length Based Insert Sort

Many applications depend on efficient sort algorithm to sort large sets of distinct string keys in memory. For example, sorting records for databases in which type of prime key is string. We propose a new improved radix sort algorithm, radix plus length based insert sort algorithm(R-LI), to sort large sets of string keys. The algorithm are used to sort set with length-changeable string key. R-LI algorithm is improvement ofR-S algorithm given by M.DONALD Ma- claren at 1966. Any radix sort method can be used as the first step of R-LI algorithm. The algorithm are based on characters which we give in this article as theorems. Detailed performance analysis is also given. R-LI algorithm is very faster than any simple radix sort which be used as first step of R-LI algorithm.