From a83454b4f99887e4fa068d22bf40b7305b97ec63 Mon Sep 17 00:00:00 2001
From: CHAITANYA KODAVALI <kodavali.jkchaitanya.cse17@itbhu.ac.in>
Date: Thu, 28 Oct 2021 22:47:15 +0530
Subject: [PATCH 1/2] sorted existing matrices and improved performance

---
 C++/Algorithms/sorting.cpp | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 C++/Algorithms/sorting.cpp

diff --git a/C++/Algorithms/sorting.cpp b/C++/Algorithms/sorting.cpp
new file mode 100644
index 00000000..f0dbd560
--- /dev/null
+++ b/C++/Algorithms/sorting.cpp
@@ -0,0 +1,28 @@
+#include<iostream>
+using namespace std;
+void selectionSort(int a[], int n) {
+   int i, j, min, temp;
+   for (i = 0; i < n - 1; i++) {
+      min = i;
+      for (j = i + 1; j < n; j++)
+      if (a[j] < a[min])
+      min = j;
+      temp = a[i];
+      a[i] = a[min];
+      a[min] = temp;
+   }
+}
+int main() {
+   int a[] = { 22, 91, 35, 78, 10, 8, 75, 99, 1, 67 };
+   int n = sizeof(a)/ sizeof(a[0]);
+   int i;
+   cout<<"Given array is:"<<endl;
+   for (i = 0; i < n; i++)
+   cout<< a[i] <<" ";
+   cout<<endl;
+   selectionSort(a, n);
+   printf("\nSorted array is: \n");
+   for (i = 0; i < n; i++)
+   cout<< a[i] <<" ";
+   return 0;
+}

From d3d637e754930e12d481bacbb231aa713ae7236e Mon Sep 17 00:00:00 2001
From: CHAITANYA KODAVALI <kodavali.jkchaitanya.cse17@itbhu.ac.in>
Date: Thu, 28 Oct 2021 23:09:16 +0530
Subject: [PATCH 2/2] Enhanced integrity check for Database schema

---
 .../Divide-and-Conquer/Intergrity.java        | 53 +++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 Java/Algorithms/Divide-and-Conquer/Intergrity.java

diff --git a/Java/Algorithms/Divide-and-Conquer/Intergrity.java b/Java/Algorithms/Divide-and-Conquer/Intergrity.java
new file mode 100644
index 00000000..cd0a865d
--- /dev/null
+++ b/Java/Algorithms/Divide-and-Conquer/Intergrity.java
@@ -0,0 +1,53 @@
+// Java program to calculate SHA-1 hash value
+
+import java.math.BigInteger;
+import java.security.MessageDigest;
+import java.security.NoSuchAlgorithmException;
+
+public class GFG {
+	public static String encryptThisString(String input)
+	{
+		try {
+			// getInstance() method is called with algorithm SHA-1
+			MessageDigest md = MessageDigest.getInstance("SHA-1");
+
+			// digest() method is called
+			// to calculate message digest of the input string
+			// returned as array of byte
+			byte[] messageDigest = md.digest(input.getBytes());
+
+			// Convert byte array into signum representation
+			BigInteger no = new BigInteger(1, messageDigest);
+
+			// Convert message digest into hex value
+			String hashtext = no.toString(16);
+
+			// Add preceding 0s to make it 32 bit
+			while (hashtext.length() < 32) {
+				hashtext = "0" + hashtext;
+			}
+
+			// return the HashText
+			return hashtext;
+		}
+
+		// For specifying wrong message digest algorithms
+		catch (NoSuchAlgorithmException e) {
+			throw new RuntimeException(e);
+		}
+	}
+
+	// Driver code
+	public static void main(String args[]) throws
+									NoSuchAlgorithmException
+	{
+
+		System.out.println("HashCode Generated by SHA-1 for: ");
+
+		String s1 = "GeeksForGeeks";
+		System.out.println("\n" + s1 + " : " + encryptThisString(s1));
+
+		String s2 = "hello world";
+		System.out.println("\n" + s2 + " : " + encryptThisString(s2));
+	}
+}