Validation says my code is not recursive?

Question about the task

Factorization using recursion

Java Collections, Level 4, Lesson 2

Resolved

I don't understand how my solution is not recursive. Any ideas?

Separate the whole number n, where n > 1, into its prime factors.
Display all of its factors in ascending order, separated by spaces.
Write a recursive method to calculate the prime factors.
Don't create additional fields in the Solution class.

Example:
132

Console output:
2 2 3 11

Requirements:

Additional fields must not be created in the Solution class.
The recurse method must display all of the prime factors of the number passed as an argument (see the example in the task conditions).
The recurse method must not be static.
The recurse method must be recursive.

package com.codegym.task.task34.task3403; import java.util.ArrayList; /* Factorization using recursion */ public class Solution { public void recurse(int n) { if (n<=1) { System.out.print(""); return; } //find the smallest divider int deler = 2; while (n%deler != 0) deler++; //divide n by the deler while (n%deler == 0) { n /= deler; System.out.print(deler+" "); } //factorize the remaining number n again if (n>1) recurse(n); } }

Comments (3)

Popular
New
Old

You must be signed in to leave a comment

AnnemiekFF

Level 41 , Breda, Netherlands

15 May 2020, 07:52

solution

try to make it so you always get to a point with only 1 S.O.P and 1 recurse call. So you start with if (n > 1) then you have a for loop which start with i=2 then you have an if with a modulo That prints, calls recurse and breaks.

Ellen

Level 29 , Antwerpen, Belgium

17 May 2020, 11:01

Thank you, that worked and is indeed much cleaner code! One more question: what is S.O.P?

AnnemiekFF

Level 41 , Breda, Netherlands

18 May 2020, 07:36

System.out.print or System.out.println.