feat: Add PrintPrime program to display prime numbers in a range with formatted output

WHAT the code does:
Defines a PrintPrime class with:
- isPrime(int n): returns true if n is prime, false otherwise.
- main(): reads a start and end value from the user, prints all prime numbers between them, formatted with 10 primes per line.

WHY this matters:
Improves on a basic prime-checking program by:
- Handling edge cases explicitly (0 and 1 are not prime).
- Using sqrt(n) as the loop limit, making prime checks more efficient than n/2.
- Adding formatted output with tab spacing and line breaks for readability.
Shows a real-world refinement of a classic beginner algorithm.

HOW it works:
User inputs a start and end value.
For each number in the range:
- isPrime() tests divisibility from 2 up to √n.
- If prime, prints the number followed by a tab.
A counter tracks how many primes have been printed; every 10 primes, a newline is inserted.
Example: Input 1 → 50 prints primes neatly arranged in rows of 10.

Tips and gotchas:
Efficiency: Checking up to √n reduces time complexity of prime testing.
Readability: Tab spacing and row breaks make large outputs easier to scan.
Edge cases: Numbers ≤ 1 are skipped correctly.
Scanner should be closed after use to avoid resource warnings.
For very large ranges, consider Sieve of Eratosthenes for significant performance gains.

Use-cases:
Educational program demonstrating improved prime checking.
Useful tool for quickly listing primes in a given range with formatted output.
Foundation for learning about algorithmic optimization and user-friendly console formatting.

Short key: class-printprime range-primes formatted-output sqrt-optimization.

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

Author: Someshdiwan

Section10Methods/src/PrintPrime.java

@@ -0,0 +1,35 @@
+import java.util.Scanner;
+
+public class PrintPrime {
+    static boolean isPrime(int n) {
+        if (n <= 1) return false; // 0 and 1 are not prime
+
+        for(int i = 2; i * i <= n; i++) {
+            if(n % i == 0)
+                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:");
+
+        int count = 0;
+        for(int num = start; num <= end; num++) {
+            if(isPrime(num)) {
+                System.out.print(num + "\t"); // tab space between numbers
+                count++;
+                if(count % 10 == 0) { // print 10 numbers per line
+                    System.out.println();
+                }
+            }
+        }
+    }
+}