Big Sorting Source : Hackerrank
Consider an array of numeric strings, , where each string is a positive number with anywhere from to digits. Sort the array’s elements in non-decreasing (i.e., ascending) order of their real-world integer values and print each element of the sorted array on a new line.
The first line contains an integer, , denoting the number of strings in .
Each of the subsequent lines contains a string of integers describing an element of the array.
- Each string is guaranteed to represent a positive integer.
- The total number of digits across all strings in is between and (inclusive).
Print each element of the sorted array on a new line.
Sample Input 0
6 31415926535897932384626433832795 1 3 10 3 5
Sample Output 0
1 3 3 5 10 31415926535897932384626433832795
Solution is very easy as of now. Only hint is think Big ;)