This is the synopsis of the program:

Octonumero (ver 2)

An octonumero of a number x is found as follows.

1. Convert x to base 8, call this p
2. Sort the digits of p in increasing order, call this q
3. Subtract q from p in octal (convert q and p to decimal, subtract and convert back to octal)
4. Repeat steps 2 - 3, four more times or until the digits in the result are in sorted order.
5. Convert the number back to decimal

Example:

x = 3418₁₀

convert: 3418₁₀ = 6532₈

sort and subtract: 6532₈ - 2356₈ = 4154₈

4 more times: 4154₈ - 1445₈ = 2507₈

3 more times: 2507₈ - 257₈ = 2230,

2 more times: 2230₈ - 223₈ = 2005₈

last time: 2005₈ - 25₈ = 1760₈

convert: 1760₈ = 1008₁₀

How do I do these methods:

1. public static int arrayToNum ( int[] arr )

arrayToNumreturns the elements as one number such that each element becomes a digit of the returned value. The element atarr.length - 1is the ones digits

1. public static int octalSubtract (int larger, int smaller)

octalSubtractwill return the difference between larger and smaller in base 8

Can you please send me the code, as I learn better like that than the sentence explanations please? Thanks again for your time :D