From 8c4c107e4d405874f5903e146594b4036cd233e5 Mon Sep 17 00:00:00 2001
From: TusharKalyankar <kalyankartushar6946@gmail.com>
Date: Wed, 1 Sep 2021 13:47:19 +0530
Subject: [PATCH 1/2] JAVA Code added Merge two Sorted Arrays

---
 Java/Algorithms/Merge2Arrays.java | 101 ++++++++++++++++++++++++++++++
 Java/README.md                    |   2 +
 2 files changed, 103 insertions(+)
 create mode 100644 Java/Algorithms/Merge2Arrays.java

diff --git a/Java/Algorithms/Merge2Arrays.java b/Java/Algorithms/Merge2Arrays.java
new file mode 100644
index 00000000..94a98dcb
--- /dev/null
+++ b/Java/Algorithms/Merge2Arrays.java
@@ -0,0 +1,101 @@
+
+//JAVA Code for Merging 2 Sorted Arrays
+
+import java.util.Scanner;
+
+public class Merge2Arrays
+{
+	
+	public static void mergeArrays(int[] ary1, int[] ary2, int capacity1,
+								int capacity2, int[] ary3)
+	{
+		
+		int a = 0, b = 0, c = 0;
+	
+		// Traverse both array
+		while (a<capacity1 && b <capacity2)
+		{
+			//if first element of first array is smaaller than 2nd element, 
+            //then keep as it and increment first array else store in C
+			if (ary1[a] < ary2[b])
+				ary3[c++] = ary1[a++];
+			else
+				ary3[c++] = ary2[b++];
+		}
+	
+		// Assign remaining elements1 of second array if remain at last
+		while (a < capacity1)
+			ary3[c++] = ary1[a++];
+	
+		// Assign remaining elements1 of second array if remain at last
+		while (b < capacity2)
+			ary3[c++] = ary2[b++];
+	}
+	
+	public static void main (String[] args)
+	{
+		Scanner sc=new Scanner(System.in);  
+		
+		int elements1;
+		
+		System.out.print("Enter the number of elements1 you want to store: ");  
+		elements1=sc.nextInt();
+		int[] ary1 = new int[elements1];  
+
+		System.out.println("Enter your 1st Sorted Array ");
+		
+		for(int a=0; a<elements1; a++)  
+		{  
+	    //taking 1st arrayuser input
+		ary1[a]=sc.nextInt();  
+		}  
+		
+		int elements2;
+		System.out.print("Enter the number of elements1 you want to store in 2 nd array ");  
+		elements2=sc.nextInt();
+  
+		int[] ary2 = new int[elements2]; 
+		System.out.println("Enter your 2nd Sorted Array ");
+		
+		for(int a=0; a<elements2; a++)  
+		{  
+            //taking 2 nd array from user
+		ary2[a]=sc.nextInt();  
+		}  
+		
+
+	
+		int[] ary3 = new int[elements1+elements2];
+
+        //function call
+		mergeArrays(ary1, ary2, elements1, elements2, ary3);
+	
+		System.out.println("After merging Array1 and Array2 both");
+		for (int a=0; a < elements1+elements2; a++)
+			System.out.print(ary3[a] + " ");
+	}
+}
+
+/*
+Sample INPUT and OUTPUT:
+
+Enter the number of elements1 you want to store: 4
+Enter your 1st Sorted Array 
+7 9 11 13
+
+Enter the number of elements1 you want to store in 2 nd array 4
+Enter your 2nd Sorted Array 
+10 12 14 16
+
+After merging Array1 and Array2 both
+7 9 10 11 12 13 14 16
+
+    Input : Two Sorted Arrays
+	Output: Merging Both the arrays
+	Algorithm: JAVA code to merge 2 sorted arrays
+
+    
+    Time Complexity: O(n)
+    Space Complexity: O(n)
+
+*/
\ No newline at end of file
diff --git a/Java/README.md b/Java/README.md
index 7e1fd367..94928959 100644
--- a/Java/README.md
+++ b/Java/README.md
@@ -119,6 +119,8 @@ Format: -[Program name](package/name of the file)
 
 -[Merge Sort Java](Sorting/MergeSort.java)
 
+-[Merge Two Sorted Arrays using JAVA](Algorithms/Merge2Arrays.java)
+
 -[Minimum number of denominations using Greedy algo approach](Algorithms/MinDenominations_GreedyAlgo.java)
 
 -[Nth term of ap](Algorithms/nth_term_of_ap.java)

From eca91b86c62e8ee54a38f45a38380362a2954940 Mon Sep 17 00:00:00 2001
From: TusharKalyankar <kalyankartushar6946@gmail.com>
Date: Wed, 1 Sep 2021 14:32:13 +0530
Subject: [PATCH 2/2] C Program to check if given number is Happy Number or not

---
 C/HappyNumberInC.c | 60 ++++++++++++++++++++++++++++++++++++++++++++++
 C/README.md        |  2 ++
 2 files changed, 62 insertions(+)
 create mode 100644 C/HappyNumberInC.c

diff --git a/C/HappyNumberInC.c b/C/HappyNumberInC.c
new file mode 100644
index 00000000..76791d3e
--- /dev/null
+++ b/C/HappyNumberInC.c
@@ -0,0 +1,60 @@
+
+#include <stdio.h>    
+     
+//Function to check if number happy number or not    
+int CheckHappyNo(int number){    
+    int Remender = 0, total = 0;    
+        
+    //Compute the total of squares of digits    
+    while(number > 0){    
+        Remender = number%10;    
+        total = total + (Remender*Remender);    
+        number = number/10;    
+    }    
+    return total;    
+}    
+        
+int main()    
+{    
+    int number ;
+    printf("Enter the number \n");
+    scanf("%d",&number);
+        
+    int outcome = number;    
+        
+    while(outcome != 1 && outcome != 4){    
+        outcome = CheckHappyNo(outcome);    
+    }    
+        
+    //The HapyNum alwys ends with 1    
+    if(outcome == 1)    
+        printf("This number is a Happy Number");    
+    //The number which is not HappyNum ends in a cycle of numbers repeating contains 4    
+    else if(outcome == 4)    
+        printf("This number isn't a Happy Number");     
+     
+    return 0;    
+}    
+
+/*
+
+OUTPUT: 
+  
+Enter the number 
+85
+This number isn't a Happy Number
+
+*****************************************************************
+Enter the number 
+1
+This number is a Happy Number
+
+	Input : A number
+	Output: Whether is Happy number or not
+	Algorithm: C program to check whether a number is Happy Number or not
+
+    
+    Time Complexity: O(n)
+    Space Complexity: O(n)
+
+*/
\ No newline at end of file
diff --git a/C/README.md b/C/README.md
index d66a0fe0..a992883f 100644
--- a/C/README.md
+++ b/C/README.md
@@ -26,6 +26,8 @@ Format:
 
 -[FCFS ](fcfs.c)
 
+-[Find if given number is a Happy Number or Not](HappyNumberInC.c)
+
 -[Find nth term in an A.P.](AP.c)
 
 -[Find the middle element of linked list](middle.c)