Wap to take a no as input then store it's factors in another array display only the prime factors from the array and also display how many such factors found
Answers
Answered by
0
Answer:
Given a number n, write an efficient function to print all prime factors of n. For example, if the input number is 12, then output should be “2 2 3”. And if the input number is 315, then output should be “3 3 5 7”
Explanation:
Similar questions