You should press the Match Fields to ensure that the data is synced as expected.
String answer = new String( "" );
do
{
System.out.println( "Question? " );
}
while( answer.length > 0 )
Algorithm
STEP 1: START.
STEP 2: DEFINE n, i, j.
STEP 3: SET sum =0.
STEP 4: SET n =100.
STEP 5: REPEAT STEP 6 to STEP 10 UNTIL i<=n.
STEP 6: REPEAT STEP 7 and STEP 8 UNTIL j<=i/2.
STEP 7: if i%j ==0.
STEP 8: sum =sum + j.Algorithm
STEP 1: START.
STEP 2: DEFINE n, i, j.
STEP 3: SET sum =0.
STEP 4: SET n =100.
STEP 5: REPEAT STEP 6 to STEP 10 UNTIL i<=n.
STEP 6: REPEAT STEP 7 and STEP 8 UNTIL j<=i/2.
STEP 7: if i%j ==0.
STEP 8: sum =sum + j.
Answer:
B) (x<=1)
Explanation:
Though this code given will run perfectly without any requirement of base case.But still we have to include a base case I will suggest (x<=1) because the value of x is decreased by one at each recursive call so it can handle it very well and it can handle negative values of x also if user enters it by mistake since factorial is for positive numbers only.
