求水仙花数/调整奇数偶数顺序

求水仙花数

代码：

#include<stdio.h>
#include<math.h>
//求水仙花数
int daffodils_Nums(int num)
{
	int temp1 = num;
	int temp2 = num;
	int sum = 0;
	int i=1;
	while(temp1/10)
	{
		i++;
		temp1 =temp1/ 10;
	}
	while (temp2)
	{
		sum =sum+ pow( (int)(temp2%10), i);
		temp2 =temp2/ 10;
	} 
	if (sum == num)
		return i;
	return 0;
}
int main()
{
	int t=0;
	for (int i = 0; i <= 99999; i++)
	{
		if (daffodils_Nums(i))
		{
		if (t != daffodils_Nums(i))
		{
			t = daffodils_Nums(i);
			printf("\n %d到%d之间的水仙花数：>>",(int)pow(10,t-1), (int)pow(10,t)-1);
		}
			printf("%d   ", i);
		}
	}
	return 0;
}

调整奇数偶数顺序

代码：

#include <stdio.h>
void sort1(int arr[], int len)//方法一：从前面开始不断将偶数后移。
{
	for (int i = 0; i < len; i++)
	{
		if (arr[i] % 2 == 0)
		{
			for (int j = i; j < len-1; j++)
			{
				int temp;
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j+1] = temp;
			}
		}
	}
}
void sort2(int arr[], int len)//方法二：从前面开始找偶数，后面开始找奇数，找到后交换。
{
	int left = 0;
	int right = len - 1;
	while (left < right)
	{
		while (left<right && arr[left] % 2 == 1)left++;
		while (left<right && arr[right] % 2 == 0)right--;
		int temp = arr[left];
		arr[left] = arr[right];
		arr[right] = temp;
	}
}
int main()
{
	int arr[10] = { 1,2,3,4,5,6,7,8,9,10 }; 
	printf("before : > ");
	for (int i = 0; i < 10; i++)
	{
		printf("%d   ", arr[i]);
	}
	sort2(arr, 10);
	printf("\nafter  : > ");
	for (int i = 0; i < 10; i++)
	{
		printf("%d   ", arr[i]);
	}
	return 0;
}