C语言(十三)

//前奇后偶数组
#include <stdio.h>
#include <stdlib.h>
int main_(){
int a[9] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
int i = 0;
int j = 8;
int num = 0;
while (a[i++] % 2 && i <= 8);
while (a[j–] % 2 == 0 && j >= 0);
while (i <= j)
{
num = a[i - 1];
a[i - 1] = a[j + 1];
a[j + 1] = num;

	while (a[i++] % 2);
	while (a[j--] % 2 == 0);
}


printf("前奇后偶的数组:");
for (int i = 0; i < 9; i++){
	printf("%d  ",a[i]);
}
printf("\n");
system("pause");
return 0;

}
//矩阵找数
#include <stdio.h>
#include <stdlib.h>
int findNum(int a[][3], int x, int y, int f)
{
int i = 0, j = y - 1;

while (i < x && y >= 0)
{
	if (a[i][j] > f)
	{
		j--;
	}
	else if (a[i][j] < f)
	{
		i++;
	}
	else
	{
		return 1;
	}
}
return 0;

}

int main()
{
int a[][3] = { { 1, 3, 5 },
{ 3, 5, 7 },
{ 5, 7, 9 } };
if (findNum(a, 3, 3, 2))
{
printf(“找到了\n”);
}
else
{
printf(“没找到\n”);
}
system(“pause”);
return 0;
}