Content deleted Content added
Added {{Copy edit}} tag |
No edit summary |
||
(One intermediate revision by one other user not shown) | |||
Line 1:
{{no footnotes|date=June 2020}}
'''Recursive indexing''' is an [[algorithm]] used to represent large numeric values using members of a relatively small [[Set (mathematics)|set]].
Recursive indexing itself is a method to write the successive differences of the number after extracting the maximum value of the alphabet set from the number, and continuing recursively till the difference falls in the range of the set.▼
▲Recursive indexing
Recursive indexing with a 2-letter alphabet is called [[unary code]].
Line 14 ⟶ 11:
range [0 – ''S''<sub>max</sub>).
Let ''S'' = [0 1 2 3 4 … 10], be an 11-element set, and we have to recursively index the value N=49.
According to this method,
==Decoding==
Compute the sum of the index values.
''Example:''▼
==Uses==
|