BEIJING TIME:2022-10-18 10-54-14
摘要: #1.快速排序第一趟 查看代码 #include <stdio.h> int main () { int s[]={12,23,40,74,6,55,7,63,5}; int head=0; int slength=sizeof(s)/sizeof(s[0]); int rear=slength; 阅读全文
posted @ 2022-10-12 23:32 天基系统 阅读(26) 评论(0) 推荐(0)