Main Article Content
Abstract
Sorting is a technique that arranges data in a specific order, so that they can be accessed easily. Radix sort is one of the techniques. Processors execute programs as per the definition of codes. Time of execution depends on the design of the program. Complex programs take more time of execution. This technical paper explains radix sort algorithm that has been made simpler to reduce time complexity.
Keywords
Reduced Time Complexity
Optimization
Main Logic
Input Phase
Radix logic.
Article Details
License
Authors retain the copyright without restrictions for their published content in this journal. IJSRTM is a SHERPA ROMEO Journal.
Publishing License
This is an open-access article distributed under the terms of 
How to Cite
Lahera, S., & Shah, N. (2015). RADIX SORT WITH REDUCED TIME COMPLEXITY. International Journal of Students’ Research in Technology & Management, 1(6), 624–626. Retrieved from https://mgesjournals.com/ijsrtm/article/view/107
References
- http://www.cse.iitk.ac.in/users/dsrkg/cs210/applets/sortingII/radixSort/radix.html
- http://www.stackoverflow.com/
- http://en.wikipedia.org/wiki/Radix_sort
- http://www.cprogramming.com/tutorial/computersciencetheory/radix.html
- http://www.cs.auckland.ac.nz/software/AlgAnim/radixsort.html
- http://c2.com/cgi/wiki?RadixSort