how to find the best base for radix sort:
- https://stackoverflow.com/questions/23145573/best-base-for-radix-sort
- https://cs.stackexchange.com/questions/108482/radix-sort-with-different-bases
Because of this is 1/2 or 1/4 of sizeof(int). With 256, you will use less additional memory, but 4 moves total. With 256256, you will reach the result in 2 moves only (for each int), but you need significant extra memory for counters: sizeof(int) * 2 * 256256 bytes = 512Mb
Citations
https://www.geeksforgeeks.org/radix-sort/
https://www.geeksforgeeks.org/arraylist-array-conversion-java-toarray-methods/