"The World of Algorithms" is Chapter 11 of NCERT's Ganita Manjari, in Part II of the Class 9 book, and it is completely new to Class 9. An algorithm is a fixed list of steps that always finishes and always gives the right answer. The chapter uses the greatest common divisor (gcd, the same thing as HCF) to show three algorithms for one job, and asks two questions about each: is it correct, and how many steps does it take?
This guide explains the chapter in plain words, with step tables you can copy into a notebook. If your child finds the new Part II chapters unfamiliar, a Class 9 maths tutor who knows Ganita Manjari can walk through them at the school's pace.
What Chapter 11 covers
The chapter is short (about 14 pages) and is built around these headings:
- Adding Numbers, including adding digit by digit
- Greatest Common Divisor: computing the divisors of a number, finding the gcd, and a first algorithm for gcd
- Data Structures, which leads into improving the algorithm and analysing these algorithms
- Euclid's Subtraction Algorithm
- Āryabhaṭa's Division Algorithm
- A Pinch of History
The history section tells how the word "algorithm" comes from the name of the Persian mathematician Al-Khwārizmī. The section headings name the subtraction method after Euclid and the division (remainder) method after Āryabhaṭa, from the Āryabhaṭīya (499 CE). The book's introductory pages describe the chapter as ending with "Euclid's remainder-based algorithm", so you may hear either name in class. The method is the same.
For where this chapter sits among the other 13, see the Ganita Manjari Class 9 syllabus, and for a parent's tour of all six Part II chapters, read our guide to Ganita Manjari Class 9 Part 2.
What makes something an algorithm
A recipe is nearly an algorithm. A true algorithm has three features:
- Clear steps. Anyone, or any computer, following them does exactly the same thing.
- It stops. It never runs forever.
- It is correct. It gives the right answer for every allowed input, not just the examples you tried.
The chapter starts with something your child has done since Class 2: column addition.
Example 1: column addition as an algorithm.
Add 4,786 and 3,559.
- Units: 6 + 9 = 15. Write 5, carry 1.
- Tens: 8 + 5 + 1 = 14. Write 4, carry 1.
- Hundreds: 7 + 5 + 1 = 13. Write 3, carry 1.
- Thousands: 4 + 3 + 1 = 8. Write 8.
Answer: 8,345. The point is not the sum. It is that the same four-line rule ("add the column and the carry, write the units digit, carry the tens digit") works for any two numbers of any length. That is what makes it an algorithm.
Three ways to find a gcd
The gcd of two numbers is the largest number that divides both.
Method 1: list the divisors. Write every divisor of each number and pick the largest one they share. It is correct but slow for big numbers, because you have to test many possible divisors.
Example 2: listing divisors.
Find gcd(84, 120).
Divisors of 84: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84.
Divisors of 120: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 60, 120.
Common divisors: 1, 2, 3, 4, 6, 12. Largest: 12.
Method 2: repeated subtraction (Euclid). The key fact: any number that divides both a and b also divides a − b. So the gcd does not change if you replace the larger number by the difference. Keep subtracting the smaller from the larger until the two numbers are equal. That number is the gcd.
Example 3: a subtraction step table.
Find gcd(391, 299).
| Step | Pair | Action |
|---|---|---|
| 0 | (391, 299) | 391 − 299 = 92 |
| 1 | (92, 299) | 299 − 92 = 207 |
| 2 | (92, 207) | 207 − 92 = 115 |
| 3 | (92, 115) | 115 − 92 = 23 |
| 4 | (92, 23) | 92 − 23 = 69 |
| 5 | (69, 23) | 69 − 23 = 46 |
| 6 | (46, 23) | 46 − 23 = 23 |
| 7 | (23, 23) | Equal: stop |
gcd(391, 299) = 23, after 7 subtractions. Check: 391 = 23 × 17 and 299 = 23 × 13, and 17 and 13 share no factor.
Method 3: remainders (Āryabhaṭa's division method). Notice that steps 1 to 3 above just subtracted 92 again and again. Division does all those subtractions at once. The rule is: gcd(a, b) = gcd(b, remainder when a is divided by b). Stop when the remainder is 0; the last non-zero divisor is the gcd.
Example 4: the same pair by remainders.
| Step | Division | Remainder |
|---|---|---|
| 1 | 391 = 1 × 299 + 92 | 92 |
| 2 | 299 = 3 × 92 + 23 | 23 |
| 3 | 92 = 4 × 23 + 0 | 0: stop |
gcd = 23, in 3 divisions instead of 7 subtractions.
Why step counts matter
This is the heart of the chapter's "analysing these algorithms" idea. All three methods are correct, but they are not equally fast.
Try gcd(1000, 3). Subtraction takes 335 steps: 1000 → 997 → 994 … all the way down to (1, 1). The remainder method takes 2 divisions: 1000 = 333 × 3 + 1, then 3 = 3 × 1 + 0, so the gcd is 1.
For the numbers in a school exam the difference is small. For the huge numbers that computers handle, it is the difference between an instant answer and one that never arrives. This is the first time many students are asked to judge a method rather than just use it, and that habit is valuable well beyond maths.
A quick application: a floor 391 cm by 299 cm is to be covered with equal square tiles, with no cutting. The largest tile side is gcd(391, 299) = 23 cm, and you need 17 × 13 = 221 tiles. HCF word problems like this were covered in Class 7; our Class 7 HCF and LCM word problems guide is a good refresher.
Where students get stuck
Our tutors often see these four problems with the new chapter.
- Treating it as "just HCF again". Students who already know prime factorisation skip the step tables and lose the marks for the method. Fix: whenever a question names an algorithm, show that algorithm's table, even if you know a faster route.
- Mixing up quotient and remainder. In 299 = 3 × 92 + 23, some students carry 3 forward instead of 23. Fix: write every line in the form "a = q × b + r" and circle r before moving on.
- Stopping at the wrong moment. In the remainder method the gcd is the last non-zero remainder (the divisor in the final line), not 0. In the subtraction method you stop when the pair is equal. Fix: write the stopping rule at the top of the table before starting.
- Not explaining why it works. Questions may ask why gcd(a, b) = gcd(a − b, b). Fix: learn the one-line reason: anything that divides a and b divides a − b, and anything that divides a − b and b divides a.
The 5-question parent check
| Ask your child | A secure answer sounds like |
|---|---|
| "What is an algorithm, in one sentence?" | "A fixed set of steps that always stops and always gives the right answer." |
| "Why can you subtract the smaller number from the larger without changing the gcd?" | "Any common divisor of the two numbers also divides their difference." |
| "Find gcd(36, 60) by remainders." | 60 = 1 × 36 + 24, 36 = 1 × 24 + 12, 24 = 2 × 12 + 0, so 12. |
| "Which method is quicker for gcd(1000, 3), and why?" | "Division, because it does hundreds of subtractions in one go." |
| "Where does the word 'algorithm' come from?" | "From Al-Khwārizmī's name." |
If your child answers the third question without a table, ask them to write the table anyway. The method is what the chapter tests.
How to practise (10–15 minutes a day)
- One pair, two methods. Pick two 3-digit numbers, find their gcd by subtraction and by remainders, and count the steps of each.
- Predict, then count. Before starting, guess which pair will need more steps. Pairs like (1000, 3) surprise students.
- Explain aloud. Once a week, ask your child to teach the remainder method to you. If they can explain the stopping rule, they understand it.
- Write your own algorithm for something everyday, such as finding the tallest person in a list, and test whether it always stops.
Where this leads next
The next chapter in Part II is Quadrilaterals, covered in our Class 9 quadrilaterals and midpoint theorem guide. The remainder idea itself returns later in number theory and in any computer science course, where judging an algorithm by its step count is a basic skill.
How Maths Bodhi helps
Our tutors teach this chapter as reasoning, not as another way to find HCF. Students build the step tables themselves, explain each stopping rule, and compare methods, which is the kind of thinking the new book rewards. Families on other boards can read about our Class 9 maths home tutors.
Home tuition is available in Gurgaon (Gurugram). Students elsewhere in India and abroad learn with us online. You can book a free demo class.
Frequently asked questions
- Which chapter is The World of Algorithms in Class 9?
- It is Chapter 11 of NCERT's Ganita Manjari, the third chapter of Part II.
- What is an algorithm?
- A fixed, clear set of steps that always finishes and always gives the correct answer for every allowed input.
- What is Euclid's subtraction algorithm?
- Keep replacing the larger number by the difference of the two until they are equal; that number is the gcd.
- What is Āryabhaṭa's division algorithm for gcd?
- Divide the larger number by the smaller and replace the pair with the smaller number and the remainder; repeat until the remainder is 0, and the last divisor is the gcd.
- Is gcd the same as HCF?
- Yes. Greatest common divisor and highest common factor are two names for the same number.
- Why does the chapter count steps?
- To compare algorithms. All the gcd methods are correct, but the remainder method needs far fewer steps for large numbers.
