From 168d7fab5a6bfd65dc433a00fc93368fc8c4588f Mon Sep 17 00:00:00 2001
From: aripradeep <63444726+aripradeep@users.noreply.github.com>
Date: Sat, 10 Oct 2020 08:15:14 +0530
Subject: [PATCH 1/5] Create Cprogram -1

---
 Cprogram -1 | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 Cprogram -1

diff --git a/Cprogram -1 b/Cprogram -1
new file mode 100644
index 00000000..dd1c99da
--- /dev/null
+++ b/Cprogram -1	
@@ -0,0 +1,24 @@
+package Edureka;
+import java.util.Scanner;
+public class Palindrome {
+static void checkPalindrome(String input) {
+//Assuming result to be true
+boolean res = true;
+int length = input.length();
+//dividing the length of the string by 2 and comparing it.
+for(int i=0; i<= length/2; i++) {
+if(input.charAt(i) != input.charAt(length-i-1)) {
+res = false;
+break;
+}
+}
+System.out.println(input + " is palindrome = "+res);
+}
+public static void main(String[] args) {
+Scanner sc = new Scanner(System.in);
+System.out.print("Enter your Statement: ");
+String str = sc.nextLine();
+//function call
+checkPalindrome(str);
+}
+}

From c746c5fa1d7030ac0c16a4e2d40a936ce6a41dfc Mon Sep 17 00:00:00 2001
From: aripradeep <63444726+aripradeep@users.noreply.github.com>
Date: Sat, 10 Oct 2020 08:24:25 +0530
Subject: [PATCH 2/5] Create Array in small

---
 Array in small | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 Array in small

diff --git a/Array in small b/Array in small
new file mode 100644
index 00000000..3e5b4fb6
--- /dev/null
+++ b/Array in small	
@@ -0,0 +1,24 @@
+ 
+/ Program to take 5 values from the user and store them in an array
+// Print the elements stored in the array
+#include <stdio.h>
+
+int main() {
+  int values[5];
+
+  printf("Enter 5 integers:\n");
+
+  // taking input and storing it in an array
+  for(int i = 0; i < 5; ++i) {
+     scanf("%d", &values[i]);
+     
+  }
+
+  printf("Displaying integers:\n");
+
+  // printing elements of an array
+  for(int i = 0; i < 5; ++i) {
+     printf("%d\n", values[i]);
+  }
+  return 0;
+}

From 88a74818846025a6a07a6201e40604c265901feb Mon Sep 17 00:00:00 2001
From: aripradeep <63444726+aripradeep@users.noreply.github.com>
Date: Sat, 10 Oct 2020 08:27:11 +0530
Subject: [PATCH 3/5] Create Swap 2 numbers in mini

---
 Swap 2 numbers in mini | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)
 create mode 100644 Swap 2 numbers in mini

diff --git a/Swap 2 numbers in mini b/Swap 2 numbers in mini
new file mode 100644
index 00000000..24b28a13
--- /dev/null
+++ b/Swap 2 numbers in mini	
@@ -0,0 +1,27 @@
+#include <iostream>
+
+using namespace std;
+
+int main()
+
+{
+
+    int a = 5, b = 10, temp;
+
+    cout << "Before swapping." << endl;
+
+    cout << "a = " << a << ", b = " << b << endl;
+
+    temp = a;
+
+    a = b;
+
+    b = temp;
+
+    cout << "\nAfter swapping." << endl;
+
+    cout << "a = " << a << ", b = " << b << endl;
+
+    return 0;
+
+}

From ab510b50cc790ff19f0506bcf3f6bf5e44fa8517 Mon Sep 17 00:00:00 2001
From: aripradeep <63444726+aripradeep@users.noreply.github.com>
Date: Sat, 10 Oct 2020 08:29:33 +0530
Subject: [PATCH 4/5] Create Prime Numbers Between two Intervals

---
 Prime Numbers Between two Intervals | 81 +++++++++++++++++++++++++++++
 1 file changed, 81 insertions(+)
 create mode 100644 Prime Numbers Between two Intervals

diff --git a/Prime Numbers Between two Intervals b/Prime Numbers Between two Intervals
new file mode 100644
index 00000000..397aae48
--- /dev/null
+++ b/Prime Numbers Between two Intervals	
@@ -0,0 +1,81 @@
+xample: Prime Numbers Between two Intervals
+
+#include <iostream>
+
+using namespace std;
+
+int checkPrimeNumber(int);
+
+int main() {
+
+    int n1, n2;
+
+    bool flag;
+
+    cout << "Enter two positive integers: ";
+
+    cin >> n1 >> n2;
+
+    // swapping n1 and n2 if n1 is greater than n2
+
+    if (n1 > n2) {
+
+      n2 = n1 + n2;
+
+      n1 = n2 - n1;
+
+      n2 = n2 - n1;
+
+    }
+
+    cout << "Prime numbers between " << n1 << " and " << n2 << " are: ";
+
+    for(int i = n1+1; i < n2; ++i) {
+
+        // If i is a prime number, flag will be equal to 1
+
+        flag = checkPrimeNumber(i);
+
+        if(flag)
+
+            cout << i << " ";
+
+    }
+
+    return 0;
+
+}
+
+// user-defined function to check prime number
+
+int checkPrimeNumber(int n) {
+
+    bool isPrime = true;
+
+    // 0 and 1 are not prime numbers
+
+    if (n == 0 || n == 1) {
+
+        isPrime = false;
+
+    }
+
+    else {
+
+        for(int j = 2; j <= n/2; ++j) {
+
+            if (n%j == 0) {
+
+                isPrime = false;
+
+                break;
+
+            }
+
+        }
+
+    }
+
+    return isPrime;
+
+}

From 09e7406483cfe777acbd8ae728c1f534f6276478 Mon Sep 17 00:00:00 2001
From: aripradeep <63444726+aripradeep@users.noreply.github.com>
Date: Sun, 13 Nov 2022 14:01:36 +0530
Subject: [PATCH 5/5] simp

---
 sort.js | 2 ++
 1 file changed, 2 insertions(+)
 create mode 100644 sort.js

diff --git a/sort.js b/sort.js
new file mode 100644
index 00000000..15e40d30
--- /dev/null
+++ b/sort.js
@@ -0,0 +1,2 @@
+const sorting_stuff =['1','3','5'];
+sorting_stuff.sort();