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 .