computer science

Recursive indexing

Recursive indexing is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Recursive indexing rather than just read about it. In short: Recursive indexing is an algorithm used to represent large numeric values using members of a relatively small set. Recursive indexing writes 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.

Key takeaways

Recursive indexing belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Recursive indexing to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Recursive indexing from memory before moving on to harder problems.

Reference excerpt

Recursive indexing is an algorithm used to represent large numeric values using members of a relatively small set. Recursive indexing writes 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 with a 2-letter alphabet is called unary code.

Encoding To encode a number N, keep reducing the maximum element of this set (Smax) from N and output Smax for each such difference, stopping when the number lies in the half closed half open range [0 – Smax).

Example 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, subtract 10 from 49 and iterate until the difference is a number in the 0–10 range. The values are 10 (N = 49 – 10 = 39), 10 (N = 39 – 10 = 29), 10 (N = 29 – 10 = 19), 10 (N = 19 – 10 = 9), 9. The recursively indexed sequence for N = 49 with set S, is 10, 10, 10, 10, 9.

Decoding Compute the sum of the index values.

Example Decoding the above example involves 10 + 10 + 10 + 10 + 9 = 49.

Uses This technique is most commonly used in run-length encoding systems to encode longer runs than the alphabet sizes permit.

References Khalid Sayood, Introduction to Data Compression 3rd ed, Morgan Kaufmann.

Worked examples

Example 1 — a first encounter with Recursive indexing

Start with the simplest possible case. Write down what Recursive indexing claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Recursive indexing before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Recursive indexing ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Recursive indexing

In research: Recursive indexing appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Recursive indexing in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Recursive indexing is common in secondary-school and first-year university syllabi. It links to neighbouring topics Coding theory, Data compression, Lossless compression algorithms, so understanding it makes those chapters shorter.
In everyday life: Look for Recursive indexing outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Recursive indexing in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Recursive indexing means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Recursive indexing out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Recursive indexing in simple terms?

Why does Recursive indexing matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Recursive indexing?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Recursive indexing.