一整形数组中有10个数,分别是:5,8,9,0,2,1,4,7,6,3;
自研代码:
用一个for循环做数组大小排序。
int stu_no[10] = { 9,0, 5,8,2,1,4,7,6,3 };
int minNumber = stu_no[0];
int i = 0;
for (i ; i < sizeof(stu_no) / sizeof(stu_no[0])-1;) //循环数组,自增放入循环内
{
if (stu_no[i] > stu_no[i + 1]) { //判断当前值和后一个值大小
minNumber = stu_no[i];
stu_no[i] = stu_no[i + 1];
stu_no[i + 1] = minNumber;
if (i > 0) i--;
}
else {
i++;
continue;
}
}
for (int i = 0; i < sizeof(stu_no) / sizeof(stu_no[0]); i++)
{
cout << stu_no[i] << endl;
}
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)