Abstract :

This Paper Present A New In-place Improved Radix Sort Algorithm. The Proposed Algorithm Called Improved Dynamic Radix Sort Is An Efficient And Improved Algorithm Compared To Ordinary Radix Sort. Improved Radix Sort Uses The Maximum Number Available In Input Array To Identify The Unused Bits Of Word. This Algorithm Sort Input Array Using Least Significant Digit Radix Sort Algorithm But Instead Of Sorting With Respect To Every Bit Of Word, Proposed Algorithm Will Sort Only With Respect To Used Bits. The Proposed Algorithm And Its Runtime And Space Complexity Are Discussed In Detail. We Used Counting Sort As An In-place Sorting Algorithm To Sort Array In Each Pass. We Investigated By Implementation The Performance Of Our Proposed Scheme Is Far Better Then Ordinary Radix Sort.

Published:

06-8-2018

Issue:

Vol. 18 No. 8 (2018)

Page Nos:

238-241

Section:

Articles

License:

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

How to Cite