divisible number between range

1
public static void getDivisorsListReversed(int divisor, int startRange, int endRange){ //Validation section if(startRange > endRange) return; if(endRange < divisor) return; if(divisor == 0) return; //Calculation section int actualStart = startRange - (startRange % divisor); int val = (endRange - actualStart)/divisor; for (int i= val; i>=0; i--){ System.out.println(actualStart + (divisor * i)); } }

Upload: sujith-niraikulathan

Post on 06-Sep-2015

226 views

Category:

Documents


1 download

DESCRIPTION

This is a program method to find all divisible number between a given range in reverse order

TRANSCRIPT

  • public static void getDivisorsListReversed(int divisor, int startRange, int endRange){

    //Validation section

    if(startRange > endRange) return;

    if(endRange < divisor) return;

    if(divisor == 0) return;

    //Calculation section

    int actualStart = startRange - (startRange % divisor);

    int val = (endRange - actualStart)/divisor;

    for (int i= val; i>=0; i--){

    System.out.println(actualStart + (divisor * i));

    }

    }