diff options
| author | Richard-Qin-X <richard.qin.001@gmail.com> | 2026-06-08 17:10:31 +0800 |
|---|---|---|
| committer | Richard-Qin-X <richard.qin.001@gmail.com> | 2026-06-08 17:10:31 +0800 |
| commit | 72af0dedf9e18911da65b9a5c4906689e868d9fc (patch) | |
| tree | 2ecbad93f96ab8ad7e26dc02cd02d802f853ab97 /rcc-legacy/tests/sysy_lvX/insert_sort.sy | |
| parent | 8faf6d290d6703b1775e0ad7a8928a4ebea4b11b (diff) | |
| download | rcc-project-72af0dedf9e18911da65b9a5c4906689e868d9fc.tar.gz rcc-project-72af0dedf9e18911da65b9a5c4906689e868d9fc.tar.xz | |
[legacy] Add functional and performance test suites
Diffstat (limited to 'rcc-legacy/tests/sysy_lvX/insert_sort.sy')
| -rw-r--r-- | rcc-legacy/tests/sysy_lvX/insert_sort.sy | 37 |
1 files changed, 37 insertions, 0 deletions
diff --git a/rcc-legacy/tests/sysy_lvX/insert_sort.sy b/rcc-legacy/tests/sysy_lvX/insert_sort.sy new file mode 100644 index 0000000..277d6a7 --- /dev/null +++ b/rcc-legacy/tests/sysy_lvX/insert_sort.sy @@ -0,0 +1,37 @@ +int a[1000];
+
+/* 插入排序 */
+void InsertSort(int a[],int n)
+{
+ int p;
+ int i;
+ int tmp;
+
+ p =1;
+ while(p<n){
+ tmp=a[p];/*取出未排序序列中的第一个元素*/
+ i=p;
+ while(i>=1&&a[i-1]>tmp){
+ a[i]=a[i-1];/*依次与已排序序列中元素比较并右移*/
+ i=i-1;
+ }
+ a[i]=tmp;/*放进合适的位置 */
+ p=p+1;
+ }
+}
+
+int main()
+{
+ int size;
+ int i;
+ size = getint();
+ i = 0;
+ while(i<size){
+ a[i] = getint();
+ i = i+1;
+ }
+ InsertSort(a,size);
+ putarray(size,a);
+ putch(10);
+ return 0;
+}
\ No newline at end of file |