From b3447f17d3ed7e6f5658cccc2641fb2cebb71b16 Mon Sep 17 00:00:00 2001
From: pg3o9mcf2 <859292717@qq.com>
Date: Tue, 15 Feb 2022 11:26:25 +0800
Subject: [PATCH] Update README.md

---
 README.md | 84 ++++++++++++++++++++++++++++++++++++++++++++++++++++++-
 1 file changed, 83 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index bc0df74..b9ed2f0 100644
--- a/README.md
+++ b/README.md
@@ -1,2 +1,84 @@
-# qsy
+# 冒泡排序
+#include<stdio.h>
+void bubble(int a[],int n)
+{
+  int i,j,t;
+  for(i=1;i<n;i++)
+  {
+    for(j=0;j<n-i;j++)
+    {
+      if(a[j]>a[j+1])
+      {
+        t=a[j];
+        a[j]=a[j+1];
+        a[j+1]=t;
+        }
+      }
+    }
+}
+int main(void)
+{
+  int b[10];
+  for(int i=0;i<10;i++)
+  {
+    scanf("%d",&b[10]);
+  }
+  bubble(b,10);
+  for(int i=0;i<10;i++)
+  {
+    printf("%d",b[i]);
+  }
+}
+# 快速排序
+#include<stdio.h>
+void qusort(int a[],int l,int r)
+{
+  int i,j,t,k;
+  if(l>r)
+  {
+    return;
+  }
+  t=a[l];
+  i=l;
+  j=r;
+  while(i<j)
+  {
+    while(a[j]>=t&&i<j) j--;
+    while(a[i]<=t&&i<j) i++;
+    if(i<j)
+    {
+      k=a[i];
+      a[i]=a[j];
+      a[j]=k;
+    }
+  }
+  a[l]=a[i];
+  a[i]=t;
+  qusort(l,i=1,a);
+  qusort(i+1,r,a);
+}
+int main()
+{
+  int a[100000],i=0,n;
+  scanf("%d",&n);
+  getchar();
+  char t;
+  while(i<n)
+  {
+    scanf("%d",&a[i]);
+    getchar();
+    i++;
+  }
+  qusort(0,i-1,a);
+  int j;
+  for(j=0;j<i;j++)
+  {
+    printf("%d",a[j]);
+  }
+  return 0;
+}
+
+
+
+