From 5f3ea9fd4cb64bb11a39f066099a30bad0c9fe66 Mon Sep 17 00:00:00 2001
From: Skm26 <72231348+Skm26@users.noreply.github.com>
Date: Fri, 2 Oct 2020 12:01:46 +0530
Subject: [PATCH 1/2] Added Tower of hanoi

Added a another simple program (Tower of hanoi)using recursion.
---
 Recursion/Tower_of_Hanoi.c | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 Recursion/Tower_of_Hanoi.c

diff --git a/Recursion/Tower_of_Hanoi.c b/Recursion/Tower_of_Hanoi.c
new file mode 100644
index 0000000..2ce3d40
--- /dev/null
+++ b/Recursion/Tower_of_Hanoi.c
@@ -0,0 +1,28 @@
+#include<stdio.h>
+#include<math.h>
+void main()
+{
+	int n;
+	char A,B,C;
+	void towers(int,char,char,char);
+	clrscr();
+	printf("\nTowers of Hanoi\n");
+	printf("\nEnter the number of disks : ");
+	scanf("%d",&n);
+	printf("The number of moves=%0.f\n",(pow(2,n)-1));
+	printf("\nTowers of Hanoi simulation for %d disks\n",n);
+	towers(n,'A','C','B');
+	getch();
+}
+void towers(int n,char source,char dest,char aux)
+{
+	if(n==1)
+	{
+		printf("\nMove disk %d from %c to %c",n,source,dest);
+		return;
+	}
+	towers(n-1,source,aux,dest);
+	printf("\nMove disk %d from %c to %c",n,source,dest);
+	towers(n-1,aux,dest,source);
+}
+

From 7b1b1fa01f69d894c9c9956e3d85c2bb0cee950c Mon Sep 17 00:00:00 2001
From: Skm26 <72231348+Skm26@users.noreply.github.com>
Date: Fri, 2 Oct 2020 12:08:16 +0530
Subject: [PATCH 2/2] Merge Sort

Added another program Merge Sort using recursion
---
 Programs/Merge_sort.c | 70 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 70 insertions(+)
 create mode 100644 Programs/Merge_sort.c

diff --git a/Programs/Merge_sort.c b/Programs/Merge_sort.c
new file mode 100644
index 0000000..1a727f0
--- /dev/null
+++ b/Programs/Merge_sort.c
@@ -0,0 +1,70 @@
+#include<stdio.h>
+#include<conio.h>
+void partition(int [20],int,int);
+void merge(int [20],int,int,int);
+void main()
+{
+	int i,a[20],n;
+	clrscr();
+	printf("Enter the number of elements\n");
+	scanf("%d",&n);
+	printf("Enter the elements\n");
+	for(i=0;i<n;i++)
+	scanf("%d",&a[i]);
+	printf("Orginal list\n");
+	for(i=0;i<n;i++)
+	printf("%d\t",a[i]);
+	partition(a,0,n-1);
+	printf("\nSorted list\n");
+	for(i=0;i<n;i++)
+	printf("%d\t",a[i]);
+	getch();
+}
+void partition(int a[20],int lb,int ub)
+{
+	int mid;
+	if(lb<ub)
+	{
+		mid=(lb+ub)/2;
+		partition(a,0,mid);
+		partition(a,mid+1,ub);
+		merge(a,lb,mid,ub);
+	}
+}
+void merge(int a[20],int lb,int mid,int ub)
+{
+	int c[20],i,j,k;
+	i=lb;
+	k=lb;
+	j=mid+1;
+	while((i<=mid)&&(j<=ub))
+	{
+		if(a[i]<a[j])
+		{
+			c[k]=a[i];
+			k++;
+			i++;
+		}
+		else
+		{
+			c[k]=a[j];	
+			k++;
+			j++;
+		}
+	}
+	while(i<=mid)
+	{
+		c[k]=a[i];
+		k++;
+		i++;
+	}
+	while(j<=ub)
+	{
+		c[k]=a[j];
+		k++;
+		j++;
+	}
+	for(i=lb;i<k;i++)
+	a[i]=c[i];
+}
+