Piyush365
  • 1

How would our original algorithm change if we computed the divisors of n by examining the numbers from 1 to n in reverse order, from n down to 1?

  • 1

The divisor list would be generated in decreasing order rather than increasing order. Consequently, when determining the greatest common divisor, we must report the leftmost element instead of the rightmost one.

Class 9 Ganita Manjari Part 2 chapter 11 question answer
Class 9 Ganita Manjari Part 2 chapter 11 The World of Algorithms solutions

Share

1 Answer

  1. Scanning numbers from n down to 1 populates the divisor list in descending order rather than ascending order. Because the largest divisors are added first, the list of common divisors between two numbers will also be ordered from greatest to least. To report the greatest common divisor at the end, the algorithm must select the first, leftmost element rather than the rightmost.

     

    For more NCERT Solutions of Class 9 Maths Ganita Manjari Part 2 Chapter 11 The World of Algorithms Question Answer (2026-27)

    https://www.tiwariacademy.com/ncert-solutions/class-9/maths/ganita-manjari-chapter-11/

    • 54
Leave an answer

Leave an answer

Browse