摘要: 冒泡排序 #include <iostream>using namespace std;#define N 10int main(){ int a[N]; int i,j,y,count=0,t; cout<<"请为数组元素赋初值"<<endl; for(i=0;i<=N;i++){ cin>>a[ 阅读全文
posted @ 2023-05-12 23:42 suN(小硕) 阅读(7) 评论(0) 推荐(0) 编辑