From d4d72756e318621bb2cd06f9850a9d6442f2b77d Mon Sep 17 00:00:00 2001
From: Abhishek <prajapatia2580.com>
Date: Fri, 2 Oct 2020 10:31:21 -0700
Subject: [PATCH 1/3] Added merge sort in c++ folder

---
 C++/merge_sort.cpp | 66 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 C++/merge_sort.cpp

diff --git a/C++/merge_sort.cpp b/C++/merge_sort.cpp
new file mode 100644
index 00000000..0971dfe8
--- /dev/null
+++ b/C++/merge_sort.cpp
@@ -0,0 +1,66 @@
+#include<iostream>
+using namespace std;
+void swapping(int &a, int &b) {    
+   int temp;
+   temp = a;
+   a = b;
+   b = temp;
+}
+void display(int *array, int size) {
+   for(int i = 0; i<size; i++)
+      cout << array[i] << " ";
+   cout << endl;
+}
+void merge(int *array, int l, int m, int r) {
+   int i, j, k, nl, nr;
+   nl = m-l+1; nr = r-m;
+   int larr[nl], rarr[nr];
+   for(i = 0; i<nl; i++)
+      larr[i] = array[l+i];
+   for(j = 0; j<nr; j++)
+      rarr[j] = array[m+1+j];
+   i = 0; j = 0; k = l;
+   while(i < nl && j<nr) {
+      if(larr[i] <= rarr[j]) {
+         array[k] = larr[i];
+         i++;
+      }else{
+         array[k] = rarr[j];
+         j++;
+      }
+      k++;
+   }
+   while(i<nl) {     
+      array[k] = larr[i];
+      i++; k++;
+   }
+   while(j<nr) {  
+      array[k] = rarr[j];
+      j++; k++;
+   }
+}
+void mergeSort(int *array, int l, int r) {
+   int m;
+   if(l < r) {
+      int m = l+(r-l)/2;
+      // Sort first and second arrays
+      mergeSort(array, l, m);
+      mergeSort(array, m+1, r);
+      merge(array, l, m, r);
+   }
+}
+int main() {
+   int n;
+   cout << "Enter the number of elements: ";
+   cin >> n;
+   int arr[n];     //create an array with given number of elements
+   cout << "Enter elements:" << endl;
+   for(int i = 0; i<n; i++) {
+      cin >> arr[i];
+   }
+   cout << "Array before Sorting: ";
+   display(arr, n);
+   mergeSort(arr, 0, n-1);     //(n-1) for last index
+   cout << "Array after Sorting: ";
+   display(arr, n);
+}
\ No newline at end of file

From 27fbb138a02980c4a7058f8835540809e04dd8de Mon Sep 17 00:00:00 2001
From: Abhishek <prajapatia2580.com>
Date: Fri, 2 Oct 2020 10:36:47 -0700
Subject: [PATCH 2/3] Added Quick sort in c++ folder

---
 C++/quick_sort.cpp | 69 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 69 insertions(+)
 create mode 100644 C++/quick_sort.cpp

diff --git a/C++/quick_sort.cpp b/C++/quick_sort.cpp
new file mode 100644
index 00000000..c8558f7b
--- /dev/null
+++ b/C++/quick_sort.cpp
@@ -0,0 +1,69 @@
+#include<iostream>
+using namespace std;
+void swapping(int &a, int &b) {     //swap the content of a and b
+   int temp;
+   temp = a;
+   a = b;
+   b = temp;
+}
+void display(int *array, int size) {
+   for(int i = 0; i<size; i++)
+      cout << array[i] << " ";
+   cout << endl;
+}
+void merge(int *array, int l, int m, int r) {
+   int i, j, k, nl, nr;
+   //size of left and right sub-arrays
+   nl = m-l+1; nr = r-m;
+   int larr[nl], rarr[nr];
+   //fill left and right sub-arrays
+   for(i = 0; i<nl; i++)
+      larr[i] = array[l+i];
+   for(j = 0; j<nr; j++)
+      rarr[j] = array[m+1+j];
+   i = 0; j = 0; k = l;
+   //marge temp arrays to real array
+   while(i < nl && j<nr) {
+      if(larr[i] <= rarr[j]) {
+         array[k] = larr[i];
+         i++;
+      }else{
+         array[k] = rarr[j];
+         j++;
+      }
+      k++;
+   }
+   while(i<nl) {       //extra element in left array
+      array[k] = larr[i];
+      i++; k++;
+   }
+   while(j<nr) {     //extra element in right array
+      array[k] = rarr[j];
+      j++; k++;
+   }
+}
+void mergeSort(int *array, int l, int r) {
+   int m;
+   if(l < r) {
+      int m = l+(r-l)/2;
+      // Sort first and second arrays
+      mergeSort(array, l, m);
+      mergeSort(array, m+1, r);
+      merge(array, l, m, r);
+   }
+}
+int main() {
+   int n;
+   cout << "Enter the number of elements: ";
+   cin >> n;
+   int arr[n];     //create an array with given number of elements
+   cout << "Enter elements:" << endl;
+   for(int i = 0; i<n; i++) {
+      cin >> arr[i];
+   }
+   cout << "Array before Sorting: ";
+   display(arr, n);
+   mergeSort(arr, 0, n-1);     //(n-1) for last index
+   cout << "Array after Sorting: ";
+   display(arr, n);
+}
\ No newline at end of file

From ebe4d9f7507713bcb361a30f6bd8f7460e9b43db Mon Sep 17 00:00:00 2001
From: Abhishek <abhishek.kumar@thoughts2binary.com>
Date: Sat, 3 Oct 2020 02:39:16 +0530
Subject: [PATCH 3/3] Added factorial file

---
 Java/factorial.java | 10 ++++++++++
 1 file changed, 10 insertions(+)
 create mode 100644 Java/factorial.java

diff --git a/Java/factorial.java b/Java/factorial.java
new file mode 100644
index 00000000..c9fafa3f
--- /dev/null
+++ b/Java/factorial.java
@@ -0,0 +1,10 @@
+class factorial{  
+ public static void main(String args[]){  
+  int i,fact=1;  
+  int number=5;//It is the number to calculate factorial    
+  for(i=1;i<=number;i++){    
+      fact=fact*i;    
+  }    
+  System.out.println("Factorial of "+number+" is: "+fact);    
+ }  
+} 
\ No newline at end of file