It will not work directly as described because pairs are generated out of order. The algorithm relies on an ascending list to pick the rightmost element as the GCD, requiring sorting first.
Class 9 Ganita Manjari Part 2 chapter 11 question answer
Class 9 Ganita Manjari Part 2 chapter 11 The World of Algorithms solutions
Not directly without modification. Our original algorithm assumes that the divisors appear in strictly increasing order so that the largest common factor is simply the rightmost element. Listing divisors in pairs—like (1, 18), (2, 9), (3, 6)—mixes small and large numbers together. To make the algorithm work, we would first have to sort the combined list into ascending order.
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/