diff --git a/CONTRIBUTING.md b/CONTRIBUTING.md
index 90541dc..ff30226 100644
--- a/CONTRIBUTING.md
+++ b/CONTRIBUTING.md
@@ -6,3 +6,5 @@
 
 ### Shreyans Jain
 - Github: https://github.com/Shreyans13
+### Jathin Prakash 
+- Github: https://github.com/SLICKjp
diff --git a/Data Structure/bubblesort.c b/Data Structure/bubblesort.c
new file mode 100644
index 0000000..2b8fa20
--- /dev/null
+++ b/Data Structure/bubblesort.c	
@@ -0,0 +1,31 @@
+#include<stdio.h>
+
+int main(){
+
+   int count, temp, i, j, number[30];
+
+   printf("How many numbers are u going to enter?: ");
+   scanf("%d",&count);
+
+   printf("Enter %d numbers: ",count);
+
+   for(i=0;i<count;i++)
+   scanf("%d",&number[i]);
+
+
+   for(i=count-2;i>=0;i--){
+      for(j=0;j<=i;j++){
+        if(number[j]>number[j+1]){
+           temp=number[j];
+           number[j]=number[j+1];
+           number[j+1]=temp;
+        }
+      }
+   }
+
+   printf("Sorted elements: ");
+   for(i=0;i<count;i++)
+      printf(" %d",number[i]);
+
+   return 0;
+}
diff --git a/Data Structure/bubblesort.exe b/Data Structure/bubblesort.exe
new file mode 100644
index 0000000..b05c42e
Binary files /dev/null and b/Data Structure/bubblesort.exe differ
diff --git a/Data Structure/bubblesort.o b/Data Structure/bubblesort.o
new file mode 100644
index 0000000..f649886
Binary files /dev/null and b/Data Structure/bubblesort.o differ
diff --git a/Data Structure/insertionsort.c b/Data Structure/insertionsort.c
new file mode 100644
index 0000000..353ec45
--- /dev/null
+++ b/Data Structure/insertionsort.c	
@@ -0,0 +1,28 @@
+#include<stdio.h>
+void main()
+
+{
+    int i,j,n,temp,a[20];
+    printf("Enter the size of the array");
+    scanf("%d",&n);
+    printf("Enter the elements of array");
+    for(i=0;i<n;i++)
+    {
+       scanf("%d",&a[i]);
+    }
+    for(i=1;i<n;i++){
+      temp=a[i];
+      j=i-1;
+      while((temp<a[j])&&(j>=0)){
+         a[j+1]=a[j];
+         j=j-1;
+      }
+      a[j+1]=temp;
+   }
+
+   printf("Order of Sorted elements: ");
+   for(i=0;i<n;i++)
+      printf(" %d",a[i]);
+
+
+}
diff --git a/Data Structure/insertionsort.exe b/Data Structure/insertionsort.exe
new file mode 100644
index 0000000..c8ad9e0
Binary files /dev/null and b/Data Structure/insertionsort.exe differ
diff --git a/Data Structure/insertionsort.o b/Data Structure/insertionsort.o
new file mode 100644
index 0000000..0b327ac
Binary files /dev/null and b/Data Structure/insertionsort.o differ
diff --git a/Data Structure/quicksort.c b/Data Structure/quicksort.c
new file mode 100644
index 0000000..b5b4638
--- /dev/null
+++ b/Data Structure/quicksort.c	
@@ -0,0 +1,48 @@
+#include<stdio.h>
+void quicksort(int number[25],int first,int last){
+   int i, j, pivot, temp;
+
+   if(first<last){
+      pivot=first;
+      i=first;
+      j=last;
+
+      while(i<j){
+         while(number[i]<=number[pivot]&&i<last)
+            i++;
+         while(number[j]>number[pivot])
+            j--;
+         if(i<j){
+            temp=number[i];
+            number[i]=number[j];
+            number[j]=temp;
+         }
+      }
+
+      temp=number[pivot];
+      number[pivot]=number[j];
+      number[j]=temp;
+      quicksort(number,first,j-1);
+      quicksort(number,j+1,last);
+
+   }
+}
+
+int main(){
+   int i, count, number[25];
+
+   printf("How many elements are u going to enter?: ");
+   scanf("%d",&count);
+
+   printf("Enter %d elements: ", count);
+   for(i=0;i<count;i++)
+      scanf("%d",&number[i]);
+
+   quicksort(number,0,count-1);
+
+   printf("Order of Sorted elements: ");
+   for(i=0;i<count;i++)
+      printf(" %d",number[i]);
+
+   return 0;
+}
diff --git a/Data Structure/quicksort.exe b/Data Structure/quicksort.exe
new file mode 100644
index 0000000..2de6d42
Binary files /dev/null and b/Data Structure/quicksort.exe differ
diff --git a/Data Structure/quicksort.o b/Data Structure/quicksort.o
new file mode 100644
index 0000000..12a5f47
Binary files /dev/null and b/Data Structure/quicksort.o differ