From c673318c6e226580034cd50f53530fe21822e54c Mon Sep 17 00:00:00 2001
From: APOORV MISHRA <armaanmishraapoorv@gmail.com>
Date: Fri, 25 Oct 2019 19:17:06 +0530
Subject: [PATCH 1/7] status

---
 README.md  |  3 ---
 code.c.txt | 40 ++++++++++++++++++++++++++++++++++++++++
 2 files changed, 40 insertions(+), 3 deletions(-)
 create mode 100644 code.c.txt

diff --git a/README.md b/README.md
index c3e050b..e69de29 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +0,0 @@
-# Data Structures and Algorithms in C
-
-## Won't count towards prize
diff --git a/code.c.txt b/code.c.txt
new file mode 100644
index 0000000..46d5701
--- /dev/null
+++ b/code.c.txt
@@ -0,0 +1,40 @@
+//DSA IN C
+//SORTING TECHNIQUES
+//BUBBLE SORTING
+
+#include<stdio.h>
+int main()
+{
+int arr[100];
+int n,a,i,j;
+printf("ENTER THE NUMBER OF ELEMENTS YOU WANT TO HAVE IN ARRAY:\n");
+scanf("%d",&n);
+printf("ENTER THE ARRAY:\n");
+for(a=0;a<n;a++)
+{
+scanf("%d",&arr[a]);
+}
+printf("YOUR ENTERED ARRAY IS:\n");
+for(a=0;a<n;a++)
+{
+printf("%d ",arr[a]);
+}
+for(i=0;i<n-1;i++)
+{
+	for(j=0;j<n-1;j++)
+	{
+	  if(arr[j]>arr[j+1])
+	  {
+	    arr[j]=arr[j]+arr[j+1];
+	    arr[j+1]=arr[j]-arr[j+1];
+	    arr[j]=arr[j]-arr[j+1];
+	  }
+	}
+}
+printf("YOUR SORTED ARRAY IS:\n");
+for(a=0;a<n;a++)
+{
+printf("%d ",arr[a]);
+}
+return 0;
+}
\ No newline at end of file

From f3ec68bd535a29b4bb280675c000208db0f2679a Mon Sep 17 00:00:00 2001
From: APOORV MISHRA <armaanmishraapoorv@gmail.com>
Date: Fri, 25 Oct 2019 20:56:28 +0530
Subject: [PATCH 2/7] MY 4th PULL REQUEST

---
 code2.c.txt | 37 +++++++++++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 code2.c.txt

diff --git a/code2.c.txt b/code2.c.txt
new file mode 100644
index 0000000..b531dbd
--- /dev/null
+++ b/code2.c.txt
@@ -0,0 +1,37 @@
+#include<stdio.h>
+int main()
+{
+int arr[100];
+int n,a,i,j,min;
+printf("ENTER THE NUMBER OF ELEMENTS YOU WANT TO HAVE IN ARRAY:\n");
+scanf("%d",&n);
+printf("ENTER THE ARRAY:\n");
+for(a=0;a<n;a++)
+{
+scanf("%d",&arr[a]);
+}
+printf("YOUR ENTERED ARRAY IS:\n");
+for(a=0;a<n;a++)
+{
+printf("%d ",arr[a]);
+}
+for(i=0;i<n-1;i++)
+{
+	min=arr[0];
+	for(j=i;j<n;j++)
+	{
+	  if(arr[j]<min)
+	  {
+	    min=arr[j];
+	    arr[j]=arr[i];
+	    arr[i]=min;
+	  }
+	}
+}
+printf("YOUR SORTED ARRAY IS:\n");
+for(a=0;a<n;a++)
+{
+printf("%d ",arr[a]);
+}
+return 0;
+}
\ No newline at end of file

From b96c094ecfe7066c7164ffb56f6a0a00e70bc1da Mon Sep 17 00:00:00 2001
From: APOORV MISHRA <armaanmishraapoorv@gmail.com>
Date: Sat, 26 Oct 2019 10:26:59 +0530
Subject: [PATCH 3/7] SORTING TECHNIQUES

---
 SORTING/bubble sort.txt    | 40 ++++++++++++++++++++++++++++++++++++++
 SORTING/insertion.txt      | 36 ++++++++++++++++++++++++++++++++++
 SORTING/selection sort.txt | 37 +++++++++++++++++++++++++++++++++++
 3 files changed, 113 insertions(+)
 create mode 100644 SORTING/bubble sort.txt
 create mode 100644 SORTING/insertion.txt
 create mode 100644 SORTING/selection sort.txt

diff --git a/SORTING/bubble sort.txt b/SORTING/bubble sort.txt
new file mode 100644
index 0000000..46d5701
--- /dev/null
+++ b/SORTING/bubble sort.txt	
@@ -0,0 +1,40 @@
+//DSA IN C
+//SORTING TECHNIQUES
+//BUBBLE SORTING
+
+#include<stdio.h>
+int main()
+{
+int arr[100];
+int n,a,i,j;
+printf("ENTER THE NUMBER OF ELEMENTS YOU WANT TO HAVE IN ARRAY:\n");
+scanf("%d",&n);
+printf("ENTER THE ARRAY:\n");
+for(a=0;a<n;a++)
+{
+scanf("%d",&arr[a]);
+}
+printf("YOUR ENTERED ARRAY IS:\n");
+for(a=0;a<n;a++)
+{
+printf("%d ",arr[a]);
+}
+for(i=0;i<n-1;i++)
+{
+	for(j=0;j<n-1;j++)
+	{
+	  if(arr[j]>arr[j+1])
+	  {
+	    arr[j]=arr[j]+arr[j+1];
+	    arr[j+1]=arr[j]-arr[j+1];
+	    arr[j]=arr[j]-arr[j+1];
+	  }
+	}
+}
+printf("YOUR SORTED ARRAY IS:\n");
+for(a=0;a<n;a++)
+{
+printf("%d ",arr[a]);
+}
+return 0;
+}
\ No newline at end of file
diff --git a/SORTING/insertion.txt b/SORTING/insertion.txt
new file mode 100644
index 0000000..0e6e1bf
--- /dev/null
+++ b/SORTING/insertion.txt
@@ -0,0 +1,36 @@
+\\insertion sorting using 2 for loops
+
+#include<stdio.h>
+int main()
+{
+	int arr[100];
+	int i,j,a,n,temp;
+	printf("ENTER THE NUMBER OF ELEMENTS TO BE PRESENT IN ARRAY:\n");
+	scanf("%d",&n);
+	printf("ENTER THE ARRAY:\n");
+    for(a=0;a<n;a++)
+    {
+	scanf("%d",&arr[a]);
+    }
+    printf("YOUR ENTERED ARRAY IS:\n");
+    for(a=0;a<n;a++)
+    {
+     printf("%d";arr[a]);
+    }
+    for(i=1;i<n;i++)
+    {
+       temp=arr[i];
+       for(j=i-1;j>=0&&arr[j]>temp;j--)
+       {
+          arr[j+1]=arr[j];
+
+       }
+         arr[j+1]=temp;
+    }
+    printf("YOUR SORTED ARRAY IS:\n");
+    for(a=0;a<n;a++)
+    {
+       printf("%d",arr[a]);
+    }
+    return 0;
+}
\ No newline at end of file
diff --git a/SORTING/selection sort.txt b/SORTING/selection sort.txt
new file mode 100644
index 0000000..b531dbd
--- /dev/null
+++ b/SORTING/selection sort.txt	
@@ -0,0 +1,37 @@
+#include<stdio.h>
+int main()
+{
+int arr[100];
+int n,a,i,j,min;
+printf("ENTER THE NUMBER OF ELEMENTS YOU WANT TO HAVE IN ARRAY:\n");
+scanf("%d",&n);
+printf("ENTER THE ARRAY:\n");
+for(a=0;a<n;a++)
+{
+scanf("%d",&arr[a]);
+}
+printf("YOUR ENTERED ARRAY IS:\n");
+for(a=0;a<n;a++)
+{
+printf("%d ",arr[a]);
+}
+for(i=0;i<n-1;i++)
+{
+	min=arr[0];
+	for(j=i;j<n;j++)
+	{
+	  if(arr[j]<min)
+	  {
+	    min=arr[j];
+	    arr[j]=arr[i];
+	    arr[i]=min;
+	  }
+	}
+}
+printf("YOUR SORTED ARRAY IS:\n");
+for(a=0;a<n;a++)
+{
+printf("%d ",arr[a]);
+}
+return 0;
+}
\ No newline at end of file

From f26e230ff673198f1dc16f4c787697ceb36ed151 Mon Sep 17 00:00:00 2001
From: Apoorv Nath Mishra <55011904+APOORVMISHRA21@users.noreply.github.com>
Date: Thu, 1 Jul 2021 13:23:31 +0530
Subject: [PATCH 4/7] Delete SORTING directory

---
 SORTING/bubble sort.txt    | 40 --------------------------------------
 SORTING/insertion.txt      | 36 ----------------------------------
 SORTING/selection sort.txt | 37 -----------------------------------
 3 files changed, 113 deletions(-)
 delete mode 100644 SORTING/bubble sort.txt
 delete mode 100644 SORTING/insertion.txt
 delete mode 100644 SORTING/selection sort.txt

diff --git a/SORTING/bubble sort.txt b/SORTING/bubble sort.txt
deleted file mode 100644
index 46d5701..0000000
--- a/SORTING/bubble sort.txt	
+++ /dev/null
@@ -1,40 +0,0 @@
-//DSA IN C
-//SORTING TECHNIQUES
-//BUBBLE SORTING
-
-#include<stdio.h>
-int main()
-{
-int arr[100];
-int n,a,i,j;
-printf("ENTER THE NUMBER OF ELEMENTS YOU WANT TO HAVE IN ARRAY:\n");
-scanf("%d",&n);
-printf("ENTER THE ARRAY:\n");
-for(a=0;a<n;a++)
-{
-scanf("%d",&arr[a]);
-}
-printf("YOUR ENTERED ARRAY IS:\n");
-for(a=0;a<n;a++)
-{
-printf("%d ",arr[a]);
-}
-for(i=0;i<n-1;i++)
-{
-	for(j=0;j<n-1;j++)
-	{
-	  if(arr[j]>arr[j+1])
-	  {
-	    arr[j]=arr[j]+arr[j+1];
-	    arr[j+1]=arr[j]-arr[j+1];
-	    arr[j]=arr[j]-arr[j+1];
-	  }
-	}
-}
-printf("YOUR SORTED ARRAY IS:\n");
-for(a=0;a<n;a++)
-{
-printf("%d ",arr[a]);
-}
-return 0;
-}
\ No newline at end of file
diff --git a/SORTING/insertion.txt b/SORTING/insertion.txt
deleted file mode 100644
index 0e6e1bf..0000000
--- a/SORTING/insertion.txt
+++ /dev/null
@@ -1,36 +0,0 @@
-\\insertion sorting using 2 for loops
-
-#include<stdio.h>
-int main()
-{
-	int arr[100];
-	int i,j,a,n,temp;
-	printf("ENTER THE NUMBER OF ELEMENTS TO BE PRESENT IN ARRAY:\n");
-	scanf("%d",&n);
-	printf("ENTER THE ARRAY:\n");
-    for(a=0;a<n;a++)
-    {
-	scanf("%d",&arr[a]);
-    }
-    printf("YOUR ENTERED ARRAY IS:\n");
-    for(a=0;a<n;a++)
-    {
-     printf("%d";arr[a]);
-    }
-    for(i=1;i<n;i++)
-    {
-       temp=arr[i];
-       for(j=i-1;j>=0&&arr[j]>temp;j--)
-       {
-          arr[j+1]=arr[j];
-
-       }
-         arr[j+1]=temp;
-    }
-    printf("YOUR SORTED ARRAY IS:\n");
-    for(a=0;a<n;a++)
-    {
-       printf("%d",arr[a]);
-    }
-    return 0;
-}
\ No newline at end of file
diff --git a/SORTING/selection sort.txt b/SORTING/selection sort.txt
deleted file mode 100644
index b531dbd..0000000
--- a/SORTING/selection sort.txt	
+++ /dev/null
@@ -1,37 +0,0 @@
-#include<stdio.h>
-int main()
-{
-int arr[100];
-int n,a,i,j,min;
-printf("ENTER THE NUMBER OF ELEMENTS YOU WANT TO HAVE IN ARRAY:\n");
-scanf("%d",&n);
-printf("ENTER THE ARRAY:\n");
-for(a=0;a<n;a++)
-{
-scanf("%d",&arr[a]);
-}
-printf("YOUR ENTERED ARRAY IS:\n");
-for(a=0;a<n;a++)
-{
-printf("%d ",arr[a]);
-}
-for(i=0;i<n-1;i++)
-{
-	min=arr[0];
-	for(j=i;j<n;j++)
-	{
-	  if(arr[j]<min)
-	  {
-	    min=arr[j];
-	    arr[j]=arr[i];
-	    arr[i]=min;
-	  }
-	}
-}
-printf("YOUR SORTED ARRAY IS:\n");
-for(a=0;a<n;a++)
-{
-printf("%d ",arr[a]);
-}
-return 0;
-}
\ No newline at end of file

From f3e5aca31dba339681721bb29797f7ea33d6e5cb Mon Sep 17 00:00:00 2001
From: Apoorv Nath Mishra <55011904+APOORVMISHRA21@users.noreply.github.com>
Date: Thu, 1 Jul 2021 13:23:41 +0530
Subject: [PATCH 5/7] Delete README.md

---
 README.md | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 delete mode 100644 README.md

diff --git a/README.md b/README.md
deleted file mode 100644
index e69de29..0000000

From 8240c1783a8163792ebae79db74de76715f23d16 Mon Sep 17 00:00:00 2001
From: Apoorv Nath Mishra <55011904+APOORVMISHRA21@users.noreply.github.com>
Date: Thu, 1 Jul 2021 13:23:51 +0530
Subject: [PATCH 6/7] Delete code.c.txt

---
 code.c.txt | 40 ----------------------------------------
 1 file changed, 40 deletions(-)
 delete mode 100644 code.c.txt

diff --git a/code.c.txt b/code.c.txt
deleted file mode 100644
index 46d5701..0000000
--- a/code.c.txt
+++ /dev/null
@@ -1,40 +0,0 @@
-//DSA IN C
-//SORTING TECHNIQUES
-//BUBBLE SORTING
-
-#include<stdio.h>
-int main()
-{
-int arr[100];
-int n,a,i,j;
-printf("ENTER THE NUMBER OF ELEMENTS YOU WANT TO HAVE IN ARRAY:\n");
-scanf("%d",&n);
-printf("ENTER THE ARRAY:\n");
-for(a=0;a<n;a++)
-{
-scanf("%d",&arr[a]);
-}
-printf("YOUR ENTERED ARRAY IS:\n");
-for(a=0;a<n;a++)
-{
-printf("%d ",arr[a]);
-}
-for(i=0;i<n-1;i++)
-{
-	for(j=0;j<n-1;j++)
-	{
-	  if(arr[j]>arr[j+1])
-	  {
-	    arr[j]=arr[j]+arr[j+1];
-	    arr[j+1]=arr[j]-arr[j+1];
-	    arr[j]=arr[j]-arr[j+1];
-	  }
-	}
-}
-printf("YOUR SORTED ARRAY IS:\n");
-for(a=0;a<n;a++)
-{
-printf("%d ",arr[a]);
-}
-return 0;
-}
\ No newline at end of file

From c446c012b633c4b6f1f4f95d3c325f13f1d73182 Mon Sep 17 00:00:00 2001
From: Apoorv Nath Mishra <55011904+APOORVMISHRA21@users.noreply.github.com>
Date: Thu, 1 Jul 2021 13:24:00 +0530
Subject: [PATCH 7/7] Delete code2.c.txt

---
 code2.c.txt | 37 -------------------------------------
 1 file changed, 37 deletions(-)
 delete mode 100644 code2.c.txt

diff --git a/code2.c.txt b/code2.c.txt
deleted file mode 100644
index b531dbd..0000000
--- a/code2.c.txt
+++ /dev/null
@@ -1,37 +0,0 @@
-#include<stdio.h>
-int main()
-{
-int arr[100];
-int n,a,i,j,min;
-printf("ENTER THE NUMBER OF ELEMENTS YOU WANT TO HAVE IN ARRAY:\n");
-scanf("%d",&n);
-printf("ENTER THE ARRAY:\n");
-for(a=0;a<n;a++)
-{
-scanf("%d",&arr[a]);
-}
-printf("YOUR ENTERED ARRAY IS:\n");
-for(a=0;a<n;a++)
-{
-printf("%d ",arr[a]);
-}
-for(i=0;i<n-1;i++)
-{
-	min=arr[0];
-	for(j=i;j<n;j++)
-	{
-	  if(arr[j]<min)
-	  {
-	    min=arr[j];
-	    arr[j]=arr[i];
-	    arr[i]=min;
-	  }
-	}
-}
-printf("YOUR SORTED ARRAY IS:\n");
-for(a=0;a<n;a++)
-{
-printf("%d ",arr[a]);
-}
-return 0;
-}
\ No newline at end of file