From 4b9fe1b553c68028c5104b7f0534e7a8312b66eb Mon Sep 17 00:00:00 2001
From: pos2gra5i <2949973001@qq.com>
Date: Fri, 18 Feb 2022 10:06:05 +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

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

diff --git a/快速排序 b/快速排序
new file mode 100644
index 0000000..e978163
--- /dev/null
+++ b/快速排序
@@ -0,0 +1,70 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define N 10
+void display(int array[], int maxlen)
+{
+    int i;
+ 
+    for(i = 0; i < maxlen; i++)
+    {
+        printf("%-3d", array[i]);
+    }
+    printf("\n");
+ 
+    return ;
+}
+void QuickSort(int *arr, int low, int high)
+{
+    if (low < high)
+    {
+        int i = low;
+        int j = high;
+        int k = arr[low];
+        while (i < j)
+        {
+            while(i < j && arr[j] >= k)     
+            {
+                j--;
+            }
+ 
+            if(i < j)
+            {
+                arr[i++] = arr[j];
+            }
+ 
+            while(i < j && arr[i] < k)     
+            {
+                i++;
+            }
+ 
+            if(i < j)
+            {
+                arr[j--] = arr[i];
+            }
+        }
+ 
+        arr[i] = k;
+        QuickSort(arr, low, i - 1);     
+        QuickSort(arr, i + 1, high);    
+    }
+}
+int main()
+{
+    int array[N] ;
+    int n;
+    scanf("%d",&n);
+    for(int i=0;i<n;i++)
+    scanf("%d",&array[i]);
+    int maxlen =n;
+    QuickSort(array, 0, maxlen-1);  
+    
+    printf("排序后的数组\n");
+    display(array, maxlen);
+    
+    return 0;
+}/*快速排序:时间复杂度 :O(nlog2n)
+此类排序方法不稳定 
+是最常用的排序方法
+输入五个数字运行时间结果：Process exited after 6.263 seconds with return value 0*/ 
+ 
+ 
\ No newline at end of file