From bf45ae3631fd2f6911ef40be59ced0336f5d875f Mon Sep 17 00:00:00 2001
From: pg3o9mcf2 <859292717@qq.com>
Date: Sat, 19 Feb 2022 22:03:55 +0800
Subject: [PATCH] =?UTF-8?q?Add=20=E5=BF=AB=E9=80=9F=E6=8E=92=E5=BA=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 快速排序 | 49 +++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 49 insertions(+)
 create mode 100644 快速排序

diff --git a/快速排序 b/快速排序
new file mode 100644
index 0000000..bdfc74c
--- /dev/null
+++ b/快速排序
@@ -0,0 +1,49 @@
+//复杂度：O(n^2)
+//时间：1.7s
+#include<stdio.h>
+int par(int arr[],int left,int right)
+{
+	int j=left,i;
+	int select=arr[right];
+	int t;
+	for(i=left;i<right;i++)
+	{
+		if(arr[i]<select)
+		{
+			t=arr[i];
+			arr[i]=arr[j];
+			arr[j]=t;
+			j++;
+		}
+	}
+	arr[right]=arr[j];
+	arr[j]=select;
+	return j;
+ } 
+ void quickSort(int arr[],int left,int right)
+ {
+ 	int q;
+ 	if(left<right)
+	 {
+	 	q=par(arr,left,right);
+	 	quickSort(arr,left,q-1);
+	 	quickSort(arr,q+1,right);
+	  } 
+ }
+ int main()
+ {
+ 	int i=0;
+ 	int n;
+ 	scanf("%d",&n);
+ 	int a[n]; 
+ 	for(i=0;i<n;i++)
+ 	{
+ 		scanf("%d",&a[i]);
+	 }
+		 quickSort(a,0,n-1);
+		 for(i=0;i<n;i++)
+		 {
+		 	printf("%d ",a[i]);
+		 }
+	 return 0;
+ }
\ No newline at end of file