Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) Radix Plus Length Based Insert Sort May 14-May 16 ISBN: 978-0-7695-3131-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIS.2008.52
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 of R-S algorithm given by M.DONALD Maclaren 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.
Index Terms:
radix sort, string data structures, text databases
Citation:
Yongcheng Zhang, "Radix Plus Length Based Insert Sort," icis, pp.61-66, Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008), 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb