added simp changes

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;
+}

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);
+}
+}

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;
+
+}

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;
+
+}

sort.js

@@ -0,0 +1,2 @@
+const sorting_stuff =['1','3','5'];
+sorting_stuff.sort();