Home/ Questions/Q 550624
Next
Piyush365
  • 0
Asked: 2026-10-01T04:57:27+00:00 In:

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?

  • 0

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

cbse class 9 maths ganita manjari part 2 solutionsclass 9 maths ganita manjari part 2 chapter 11 question answerganita manjari part 2 chapter 11 the world of algorithms solutionsnumbers from 1 to n in reverse orderour original algorithm change if we computed
Share
    Leave an answer

    Leave an answer

    Browse