#include<stdio.h>
#define SIZEOF (sizeof(array)/sizeof(int))
int print(int *array, int n)
{
int i;
for(i = 0; i < n; i++)
{
printf("%d ", array[i]);
}
putchar('\n');
return 0;
}
void tmp(int *a, int *b)
{
int t;
t = *a;
*a = *b;
*b = t;
}
int array_fan(int *array, int n)
{
int i;
for(i = 0; i < n/2; i++){
tmp(&array[i], &array[n-i-1]);
}
return 0;
}
int main(int argc, char**argv)
{
int array[] = {1, 2, 3, 4, 5, 6};
print(array,SIZEOF);
array_fan(array, SIZEOF);
print(array,SIZEOF);
return 0;
}
时间复杂度为 O(N/2)数组逆序
最新推荐文章于 2025-01-02 22:32:58 发布