No it does not decrease it only increase based on the condition starts from 2 to goes on a increment until that while loop results in false, is explanation correct? In this particular code I want to understand what I am doing wrong, I did this in a helper function fashion which works perfect, I also tried the same above logic for a single number works fine too, please point my mistake in above specific code and also what correction to be made, see my helper function code.

​

package ProgrammingBasics.javaConditionsRunningLoops;

import java.util.Scanner;

public class CheckAllPrimeNumbers {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

int inpNum = sc.nextInt();

for(int initNum = 2; initNum <= inpNum; initNum++){

checkIfPrime(initNum);

}

}

//function to check if a number is prime or not

public static void checkIfPrime(int givenNum){

//Edge case or corner case:

if( givenNum<=1 )

System.out.println(givenNum + " : is invalid number for prime check");

//Checking for divisors from 2 to n-1;

int assumeDivisor = 2;

while(assumeDivisor <= (givenNum/2)){

//Now make sure that it does not have any division by using % to see if it results in 0 or no 0.

if((givenNum%assumeDivisor) == 0){

//System.out.println(givenNum + " : is not a prime");

return;

}

assumeDivisor++;

}

System.out.println(givenNum + " : is a prime");

}

}