Any hint will be apreciated, tk you! 🙂
package com.codegym.task.task34.task3403;
/*
Factorization using recursion
*/
public class Solution {
public void recurse(int n) {
if(n>1){
for(int i = 2; i<=n; i++){
if(n % i == 0) {
System.out.print(i + " ");
recurse(n);
break;
}
}
} else {
System.out.print("");
}
}
}