Abstract
The attribute reduction algorithm of radix sort to integer digit sequence table is not ideal. In this paper, based on how integers is stored in computer memory, low and high storage mode is designed for the solving algorithm of U/C chain structure of a new reasonable optimization. The time complexity of the algorithm from O (K|C| |U|) is reduced to O (K|C| |U| log (|M|)). The efficiency of the algorithm is improved by 3.8%.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
