Hello everyone, I’m having problems solving this algorithm in java. All I know is that I need to build two arrays, and everything else seems hazy to me.
Consider the decimal number x, which is made up of K digit integers: x = x(k-1)…x(1)x(0)
Everything between the brackets is a subscript.
Where x(i) is a decimal digit. -Make two arrays of size 10. -Based on x0, insert and append the number x to the arr1 of item 0. -Make arrayl the source array and arr2 the destination array.
•Iteratively sort xi from i=1 to i=K-1 by removing all the numbers from the source array in order from left to right and appending them to the destination array of item i depending on xi.
-Increase i by one. -Rename the current source array as the destination array and the destination array as the source array.
Thank You.