Journal of E-Technology Rajesh Ramachandran 2 4 2011 http://www.dline.info/jet/fulltext/v2n4/4.pdf Radix Search is a searching algorithm for finding a particular value in a list by checking each one of its elements. It searches an item by processing individual digits and finally it undergoes a linear method also to make sure the presence or absence of the item in the list. The time complexity of Radix search is 2 (n+1) th of Linear Search where ‘n’ is the maximum number of digits of a number in the list.