Content deleted Content added
m Reverted 1 edit by 2601:191:8500:8EE0:94C9:6D6A:85AA:DC9E (talk) to last revision by Matthiaspaul (TW) |
added no footnotes tag + multiple issues wrapper + converted superfluous === section headings into body text (in italic) |
||
Line 1:
{{multiple issues|
{{Context|date=March 2014}}
{{no footnotes|date=June 2020}}
When number (generally large number) is represented in a finite alphabet set, and it cannot be represented by just one member of the set, '''Recursive indexing''' is used.▼
}}
▲When number (generally large number) is represented in a finite alphabet set, and it cannot be represented by just one member of the 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.
Line 10 ⟶ 14:
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.
Line 21 ⟶ 26:
Keep adding all the elements of the index, stopping when the index value is between (inclusive of ends) the least and penultimate elements of the set ''S''.
Continuing from above example we have 10 + 10 + 10 + 10 + 9 = 49.
| |||