diff --git a/快速排序.cpp b/快速排序.cpp
new file mode 100644
index 0000000..6d97bef
--- /dev/null
+++ b/快速排序.cpp
@@ -0,0 +1,40 @@
+#include<stdio.h>
+int a[10000],n;
+void quicksort(int left,int right)
+{
+	int i,j,t,m;
+	if(left>right)
+		return;
+	m=a[left];
+	i=left;
+	j=right;
+	while(i!=j)
+	{
+		while(a[j]>=m&&i<j)
+		j--;
+		while(a[i]<=m&&i<j)
+		i++;
+		if(i<j)
+		{
+			t=a[i];
+			a[i]=a[j];
+			a[j]=t;
+		}
+	}
+	a[left]=a[i];
+	a[i]=m;
+	quicksort(left,i-1);
+	quicksort(i+1,right);
+	return;
+ } 
+int main()
+{
+	int i,j;
+	scanf("%d",&n);
+	for(i=1;i<=n;i++)
+		scanf("%d",&a[i]);
+	quicksort(1,n);
+	for(i=1;i<=n;i++)
+		printf("%d ",a[i]);
+	return 0;
+}