From 72af0dedf9e18911da65b9a5c4906689e868d9fc Mon Sep 17 00:00:00 2001
From: Richard-Qin-X <richard.qin.001@gmail.com>
Date: Mon, 8 Jun 2026 17:10:31 +0800
Subject: [legacy] Add functional and performance test suites

---
 rcc-legacy/tests/sysy_lvX/binary_search.sy | 33 ++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 rcc-legacy/tests/sysy_lvX/binary_search.sy

(limited to 'rcc-legacy/tests/sysy_lvX/binary_search.sy')

diff --git a/rcc-legacy/tests/sysy_lvX/binary_search.sy b/rcc-legacy/tests/sysy_lvX/binary_search.sy
new file mode 100644
index 0000000..97907ee
--- /dev/null
+++ b/rcc-legacy/tests/sysy_lvX/binary_search.sy
@@ -0,0 +1,33 @@
+int BinSearch(int arr[],int len,int key)                          //折半查找法（二分法）
+{
+	int low=0;                         //定义初始最小
+	int high=len-1;                 //定义初始最大
+	int mid;                            //定义中间值
+	while(low<=high)
+	{
+		mid=(low+high)/2;              //找中间值
+		if(key==arr[mid])               //判断min与key是否相等
+			return mid;    
+		if(key>arr[mid])             //如果key>mid  则新区间为[mid+1,high]
+			low=mid+1;
+		else                                       //如果key<mid  则新区间为[low,mid-1]
+			high=mid-1;
+	}
+	return -1;                             //如果数组中无目标值key，则返回 -1 ；
+}
+int main()
+{
+	int arr2[100];
+    int n;
+    int i = 0;
+    n = getint();
+    while(i<n){
+        arr2[i] = getint();
+        i = i + 1;
+    }
+    n = BinSearch(arr2,n,9);
+    putint(n);
+	return 0;
+}
+
+
-- 
cgit v1.2.3