feat: Add PrintPrimeInBetween to list prime numbers within a user-defined range

WHAT the code does:
Defines a PrintPrimeInBetween class with:
- isPrime(int n): returns true if n is prime, false otherwise. Uses divisibility check up to √n for efficiency.
- main(): takes starting and ending numbers as input, then prints all primes between them.

WHY this matters:
Demonstrates an efficient prime-checking algorithm for educational purposes.
Improves readability by explicitly handling edge cases (0 and 1 are not prime).
Highlights the use of Scanner for interactive user input and loops for range traversal.
Provides a practical example of combining algorithms with input/output formatting.

HOW it works:
User inputs start and end values.
For each integer in the range:
- isPrime() tests divisibility from 2 up to √n.
- If no divisor is found, the number is printed as prime.
Example: Input 10 → 20 prints: 11 13 17 19.

Tips and gotchas:
Efficiency: Checking up to √n reduces unnecessary iterations compared to n/2.
Edge cases: Numbers ≤ 1 are handled correctly and skipped.
Scanner should be closed after use to release system resources.
For large ranges, consider more advanced algorithms like the Sieve of Eratosthenes.
The extra Scanner import can be removed as it is duplicated.

Use-cases:
Educational demo of prime number algorithms and user input handling in Java.
Quick utility for generating primes within a specified interval.
Foundation for extending into optimized prime-finding or number theory tools.

Short key: class-printprimeinbetween range-prime-check sqrt-optimization.

Signed-off-by: https://github.com/Someshdiwan <[email protected]>

Author: Someshdiwan

Section10Methods/src/PrintPrimeInBetween.java

@@ -0,0 +1,32 @@
+import java.util.Scanner;
+import java.util.Scanner;
+
+public class PrintPrimeInBetween {
+    static boolean isPrime(int n) {
+        if (n <= 1) return false; // 0 and 1 are not prime
+
+        // Check divisibility up to square root of n
+        for(int i = 2; i * i <= n; i++) {
+            if(n % i == 0) // n has a factor other than 1 and itself → not prime
+                return false;
+        }
+        return true;
+    }
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+
+        System.out.print("Enter the starting number: ");
+        int start = scanner.nextInt();
+
+        System.out.print("Enter the ending number: ");
+        int end = scanner.nextInt();
+
+        System.out.println("Prime numbers between " + start + " and " + end + " are:");
+
+        for(int num = start; num <= end; num++) {
+            if(isPrime(num)) {
+                System.out.print(num + " ");
+            }
+        }
+    }
+}