Algorithm: A set A [N], an array of data type is int, deposit element of 0 ~ N - 1 (1 & lt; N<=10) between integer and A [I] indicates A [j] (I indicates j),
When N=5, for example, are: A=(3,4,0,1,2), at this point, the array A of the code are defined as follows:
A, [0] code is 0.
A [I] code is: in A [0], A [1],... ], A [I - 1 is smaller than A [I] value in the number of
(I=1, 2,... , N - 1)
So the above array coding for A: B=(0,1,0,1,2)
A coding requirements through the array B, calculate the original data in A

CodePudding user response:

With exhaustive method,