Find-Prime-Numbers

prime-numbers.c

@@ -0,0 +1,35 @@
+#include <stdio.h>
+
+// Function to check if a number is prime
+int isPrime(int num) {
+    if (num <= 1) {
+        return 0; // Not prime
+    }
+    for (int i = 2; i * i <= num; i++) {
+        if (num % i == 0) {
+            return 0; // Not prime
+        }
+    }
+    return 1; // Prime
+}
+
+int main() {
+    int lower, upper;
+
+    // Input the range
+    printf("Enter the lower bound of the range: ");
+    scanf("%d", &lower);
+    printf("Enter the upper bound of the range: ");
+    scanf("%d", &upper);
+
+    // Check for primes in the range
+    printf("Prime numbers between %d and %d are:\n", lower, upper);
+    for (int i = lower; i <= upper; i++) {
+        if (isPrime(i)) {
+            printf("%d ", i);
+        }
+    }
+
+    printf("\n");
+    return 0;
+}