diff --git a/QuickSort.c b/QuickSort.c
new file mode 100644
index 0000000..b31bc33
--- /dev/null
+++ b/QuickSort.c
@@ -0,0 +1,47 @@
+#include <stdio.h>
+int swap(int &x,int &y);
+int Partition(int *a,int start,int end)
+{
+	int pivot=a[end];
+	int pIndex=start;
+	for(int i=start;i<end;i++)
+	{
+		if(a[i]<=pivot)
+		{
+		 swap(a[i],a[pIndex]);
+		 pIndex++;
+		}
+	
+	}
+	swap(a[pIndex],a[end]);
+	return pIndex;	
+}
+int swap(int &x,int &y)
+		{
+			int t;
+			t=x;
+			x=y;
+			y=t;
+		}
+void Quicksort(int *a,int start,int end)
+{
+	if(start<end)
+	{
+		int pIndex=Partition(a,start,end);
+		Quicksort(a,start,pIndex-1);
+	    Quicksort(a,pIndex+1,end);    
+	}
+	
+}
+
+int main()
+{
+	int a[]={1,4,2,67,43,35,5};
+	Quicksort(a,0,6);
+	printf("The sorted array is:");
+	int i;
+	for(i=0;i<7;i++)
+	{
+		printf("%d ",a[i]);
+	}
+}
diff --git a/README 2019 Hactoberfest 2019.md b/README 2019 Hactoberfest 2019.md
index 9c8e92f..9c1a566 100644
--- a/README 2019 Hactoberfest 2019.md	
+++ b/README 2019 Hactoberfest 2019.md	
@@ -1 +1,2 @@
 This Repositery is open for developers to contribute into hacktoberfest 2019. Please visit http://iosd.tech for details of the organisation.
+Collection of Algorithms.