c语言小程序

21、求一个3*3矩阵对角线元素之和

#include<stdio.h>
int main()
{
	int arr[3][3] = { { 1, 2, 3 }, { 4, 5, 6 }, { 7, 8, 9 } };
	int i = 0;
	int j = 0;
	int sum = 0;
	for (i = 0; i < 3; i++)
	{
		for (j = 0; j < 3; j++)
		{
			if (i == j || i+2 ==j || j+2 ==i)
			{
				sum += arr[i][j];
			}
		}
	}
	printf("对角线之和为： %d\n", sum);
	return 0;
}

22、整型数组逆序

#include<stdio.h>
void Swap(int* a, int* b)
{
	int tmp = *a;
	*a = *b;
	*b = tmp;
}

int main()
{
	int arr[] = { 1, 2, 3, 4, 5 };
	int len = sizeof(arr) / sizeof(arr[0]);
	int* begin = arr;
	int* end = arr + len - 1;
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
	while (begin < end)
	{
		Swap(begin, end);
		begin++;
		end--;
	}
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");

	return 0;
}

23、冒泡排序 2016-5-31 23:43:26

#include<stdio.h>

int main()
{
	int arr[] = { 2, 4, 3, 1, 0, 6, 9, 7, 8, 5 };
	int len = sizeof(arr) / sizeof(arr[0]);
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
	for (int i = 0; i < len ; i++)
	{
		int flag = 0;
		for (int j = i; j < len; j++)	//★★★★
		{
			if (arr[j] < arr[i])
			{
				int tmp = arr[j];
				arr[j] = arr[i];
				arr[i] = tmp;
				flag = 1;
			}
		}
		if (flag == 0)
		{
			break;
		}
	}

	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
	return 0;
}


24、将多个字符串排序输出

#include<stdio.h>
#include<assert.h>
void Compare(char* p, char* q)
{
	assert(p);
	assert(q);
	char* str = q;
	char* ptr = p;
	while (*str++ != '\0' && *ptr++ != '\0')
	{
		if (*str > *ptr)
		{
			printf("%s\n", q);
			printf("%s\n", p);
			break;
		}
		else if (*str < *ptr)
		{
			printf("%s\n", p);
			printf("%s\n", q);
			break;
		}
	}
	if (*str == '\0' && *ptr != '\0')

	{
		printf("%s\n", p);
		printf("%s\n", q);

	}
	else if (*ptr == '\0' && *str != '\0')
	{
		printf("%s\n", q);
		printf("%s\n", p);
	}
}

int main()
{
	char* p = "hello";
	char* s = "bit-tech";
	Compare(s, p);
	return 0;
}

25、递归求斐波那契数列第n个值
int Fibonacci(int n)
{
	int i = 1;
	int j = 1;
	if (n == 0)
	{
		printf("input error!\n");
		return -1;
	}
	if (n == 1)
	{
		return i;
	}
	if (n == 2)
	{
		return j;
	}

	return Fibonacci(n - 1) + Fibonacci(n - 2);
}


int main()
{
	int x = 0;
	printf("Please Enter a number:\n");
	scanf("%d", &x);
	int ret = Fibonacci(x);
	printf("%d\n", ret);
	return 0;
}

26、非递归求斐波那契数列第n个值
#include<stdio.h>
int Fibonacci(int n)
{
	int i = 1;
	int j = 1;
	int sum = 0;
	if (n == 1)
	{
		i = 1;
		return i;
	}
	if (n == 2)
	{
		j = 1;
		return j;
	}
	while (n > 2)
	{
		sum = i + j;
		i = j;
		j = sum;
		n--;
	}
	return sum;
}
int main()
{
	int x = 0;
	printf("Please Enter a number:\n");
	scanf("%d", &x);
	int ret = Fibonacci(x);
	printf("%d\n", ret);
	return 0;
}


27、编写一个函数，求字符串的长度
#include<stdio.h>
#include<assert.h>

int my_strlen(const char* p)
{
	assert(p);
	char* s = p;
	int count = 0;
	while (*s++ != '\0')
	{
		count++;
	}
	return count;
}

int main()
{
	char* str = "abcdefgh";
	int ret = my_strlen(str);
	printf("The length of str is  %d \n", ret);
	return 0;
}


28、不允许使用临时变量，求一个字符串的长度  递归
#include<stdio.h>
#include<assert.h>
int my_strlen(char* p)
{
	assert(p);
	if (*p == '\0')
	{
		return 0;
	}
	return my_strlen(p + 1) + 1;
}

int main()
{
	char* str = "abcdefgh";
	int ret = my_strlen(str);
	printf("The length of str is  %d \n", ret);
	return 0;
}

29、对一个整型数组排序 选择排序

#include<stdio.h>

void SelectSort(int* arr, int len)
{
	int min = 0;
	for (int i = 0; i < len; i++)
	{
		min = i;
		for (int j = i; j < len; j++)
		{
			if (arr[j] < arr[min])
			{
				min = j;
			}
		}
		if (min != i)
		{
			int tmp = arr[min];
			arr[min] = arr[i];
			arr[i] = tmp;
		}
	}
}

int main()
{
	int i = 0;
	int* arr[] = { 4, 8, 0, 9, 6, 2, 1, 0, 1, 7, 3, 5 };
	int len = sizeof(arr) / sizeof(arr[0]);
	SelectSort(arr, len);
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
	return 0;
}