feat: Add Prime class to check whether a number is prime using optimized loop

Add a program that:
- Accepts an integer input from the user
- Handles edge cases like numbers ≤ 1
- Uses an optimized loop to check divisibility up to √n
- Prints whether the number is Prime or Not Prime
- Demonstrates control flow, loop efficiency, and conditional logic in Java.

Author: Someshdiwan

Section5OperatorExpression/src/Prime.java

@@ -4,11 +4,14 @@ public class Prime {
     public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
         System.out.print("Please enter a number: ");
+
         int n = in.nextInt();
+
         if(n <= 1) {
             System.out.println("Neither prime nor composite");
             return;
         }
+
         int c = 2;
         while (c * c <= n) {
             if (n % c == 0) {
@@ -21,6 +24,5 @@ public static void main(String[] args) {
         if (c * c > n) {
             System.out.println("Prime");
         }
-        
     }
 }