From 9eadc5f46deac8d0915cb9d7da3894ad94e3d37c Mon Sep 17 00:00:00 2001
From: Liuhua <liuhua22@huawei.com>
Date: Thu, 11 May 2023 11:35:15 +0000
Subject: [PATCH] =?UTF-8?q?fixed=2007a8242=20from=20https://gitee.com/open?=
 =?UTF-8?q?harmony-sig/vendor=5Fbananapi/pulls/32=20fixed=207ad600b=20from?=
 =?UTF-8?q?=20https://gitee.com/openharmony-sig/vendor=5Fbananapi/pulls/31?=
 =?UTF-8?q?=20=E5=9B=9E=E9=80=80=20'Pull=20Request=20!11=20:=20CI=20bot?=
 =?UTF-8?q?=E6=B5=8B=E8=AF=95=E5=8D=955010beta1=EF=BC=8C=E8=AF=B7=E5=8B=BF?=
 =?UTF-8?q?=E5=90=88=E5=85=A5!'?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 test0510.c | 19 -------------------
 1 file changed, 19 deletions(-)
 delete mode 100644 test0510.c

diff --git a/test0510.c b/test0510.c
deleted file mode 100644
index a0bc12b..0000000
--- a/test0510.c
+++ /dev/null
@@ -1,19 +0,0 @@
-//对区间[left,right]进行划分
-
-
-int Partition(int A[],int left, int right)
-{
-    int temp =A[left]; //存放到临时变量temp
-
-    while(left < right) //只要left与right不相遇
-    {
-        while(left < right && A[right] > temp) right--;//反复左移
-        A[left] = A[right];
-
-        while(left < right && A[left] <= temp) left++;//反复右移
-        A[right] = A[left];
-    }
-
-    A[left] = temp;    //把temp放到right与left相遇的地方
-    return left;    //返回相遇下标
-}
\ No newline at end of file
-- 
Gitee