title: Sort N numbers in digit order
body: <p>Given a N number range E.g. [1 to 100], sort the numbers in digit order (i.e) For the numbers 1 to 100, the sorted output wound be
  1 10 100 11 12 13 . . . 19 2 20 21..... 99</p>
  
  <p>This is just like Radix Sort but just that the digits are sorted in reversed order to what would be done in a normal Radix Sort.</p>
  
  <p>I tried to store all the digits in each number as a linked list for faster operation but it results in a large Space Complexity.</p>
  
  <p>I need a working algorithm for the question. </p>
  
  <p>From all the answers, "Converting to Strings" is an option, but is there no other way this can be done?
  Also an algorithm for Sorting Strings as mentioned above can also be given.</p>