冒泡排序
摘要:
>冒泡排序 ````c #include int main() { int s[10]={12,65,32,69,5,8,21,36,4,15}; int i=0,j=0,c=0,b=0; int len=sizeof(s)/sizeof(int); for(i=0;is[i+1]) { b=s[i 阅读全文
posted @ 2023-05-25 20:42
wessf
阅读(6)
评论(0)
推荐(0)