Help post : How can I generate all the divisors of a number from its prime factorization without using recursion ?

Revision en2, by Tanbin_Hasan, 2020-09-25 19:55:25

https://www.geeksforgeeks.org/generating-all-divisors-of-a-number-using-its-prime-factorization/

Here , I got a answer for it . But I didn't understand the recursion process .

Could you please help me to do this iteratively ? Kindly convert it from recursive to iterative form . Need help from my programmer brothers . I'll be grateful to you all .

Thanks in advance .

Tags #number_theory

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Tanbin_Hasan 2020-09-25 19:55:25 60
en1 English Tanbin_Hasan 2020-09-25 19:47:13 461 Initial revision (published)