数组倒叙:
void move(int*p, int n)
{
int k, c;
for (k = 0; k <= n / 2; k++)
{
c = p[k];
p[k] = p[n - k];
p[n - k] = c;
}
}
数组冒泡排序:
int maop(int *a, int size)
{
int i = 0;
for (i = 0; i <size - 1; i++)
{
int j = 0;
for (j = 0; j < size - 1 - i; j++)
{
int tmp = 0;
if (a[j]>a[j + 1])
{
tmp = a[j];
a[j] = a[j + 1];
a[j + 1] = tmp;
}
}
}
return a;
}
数组倒叙存储,冒泡排序
最新推荐文章于 2024-08-05 15:45:51 发布