From 08416fa859c2586b60970a250917f4552e33d89c Mon Sep 17 00:00:00 2001
From: Udhay <72250606+Udhay-Brahmi@users.noreply.github.com>
Date: Wed, 16 Dec 2020 08:07:05 +0530
Subject: [PATCH] Create Find Prime numbers in a range

These PR's consist of most difficult for me while my early stage of learning ds/algo.
---
 Find Prime numbers in a range | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)
 create mode 100644 Find Prime numbers in a range

diff --git a/Find Prime numbers in a range b/Find Prime numbers in a range
new file mode 100644
index 0000000..820ae0d
--- /dev/null
+++ b/Find Prime numbers in a range	
@@ -0,0 +1,26 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+	//code
+	int n,a,b;cin>>n;
+	int arr[1000001]={0};
+	for(int i=2;i<1000000;i++){
+	    int k=i;
+	    k+=i;
+	    while(k<=1000000){
+	        arr[k]=1;
+	        k+=i;
+	    }
+	}
+	while(n--){
+	    cin>>a>>b;int k;
+	    if(a>=2){k=a;}
+	    else{k=2;}
+	    for(int i=k;i<=b;i++){
+	        if(arr[i]==0){cout<<i<<" ";}
+	    }
+	    cout<<endl;
+	}
+	return 0;
+}