C语言学习练习【一维数组】

一、使用一维数组输出fibonacci数列的前十项

 void fibonacci(void)
{
    
    
    //求fibonacci数列的前十项, 并在数组中逆序存放
    int fib[10] = {
    
    1, 1};
    int i = 0, j = 0;
    int temp = 0;
    int len_f = sizeof(fib) / sizeof(fib[0]);
    for(i = 2; i < len_f;  i++)
    {
    
    
        fib[i] = fib[i-2] + fib[i-1];
    }
	for(i = 0; i < len_f; i++)
    {
    
    
        printf("%d\t", fib[i]);
    }
    printf("\n");
    printf("------------------------------------------------\n");
    i = 0;
    j = len_f - 1;
    while(i < j)
    {
    
    
        temp = fib[i];
        fib[i] = fib[j];
        fib[j] = temp;
        i++;
        j--;
    }
    printf("------------------------------------------------\n");
    for(i = 0; i < 10; i++)
    {
    
    
        printf("%d\t", fib[i]);
    }
    printf("\n");
    return;
}

二、冒泡排序

static void sort1(void)
{
    
    
	int len_f = 0;
	int arr[] = {
    
    1, 2,3, 4, 5};
	//len_f = sizeof(arr) / sizeof(arr[0]);
	//printf("%d\n", sizeof(arr));				// 当前数组占用字节dd		
	//printf("len(arr) = %d\n", len_f);
	int a[N] =  {
    
    12, 8, 45, 30, 98, 67, 2, 7, 68, 11};			//十个数值
	int i = 0, j = 0, tmp =  0;
	for (i = 0; i<N; i++)
	{
    
    
		printf("%d ", a[i]);
	}
	printf("\n");

	for(i = 0; i < N-1; i++)
	{
    
    
		for(j = 0; j < N-1-i;j++)
		{
    
    
			if(a[j] > a[j+1])
			{
    
    
				tmp = a[j];
				a[j] = a[j+1];
				a[j+1] = tmp;
			}
		}
	}
	
	for (i = 0; i<N; i++)
	{
    
    
		printf("%d ", a[i]);
	}
	printf("\n");
		
	return;
}

三、选择法排序

// 选择法排序
static void sort2(void)
{
    
    
	int i, j, k, temp;
	int a[N] =  {
    
    12, 8, 45, 30, 98, 67, 2, 7, 68, 11};			//十个数值
	int len = sizeof(a) / sizeof(a[0]);
	for (i = 0; i < len; i++)
	{
    
    
		printf("a[%d] = %d\t", i, a[i]);
	}
	printf("\n");
	for (i = 0; i < N-1; i++)
	{
    
    
		k = i;
		for (j = i+1; j < N; j++)
		{
    
    
			if (a[j] < a[k])
				k = j;
		}
		if (i != k)
		{
    
    
			temp = a[i];
			a[i] = a[k];
			a[k] = temp;
		}
	}
	for (i = 0; i < len; i++)
	{
    
    
		printf("a[%d] = %d\t", i, a[i]);
	}
	printf("\n");
	return;
}

四、进制转换

//进制转换
static void base_convert(void)
{
    
    
	int num;
	int n[128];
	int i = 0;
	int base = 0;
	printf("Please Enter the converted num:");
	scanf("%d", &num);
	printf("Please enter the base:");
	scanf("%d", &base);
	
	do
	{
    
    
		n[i] = num % base;
		num = num / base;
		i++;
	}while(num != 0);
	
	for (i --; i >= 0; i-- )
	{
    
    
		if (n[i] >= 10)
		{
    
    
			printf("%c", n[i]-10+'A');
		}
		else
			printf("%d ", n[i]);
	}
	printf("\n");
}

五、使用删除法求1000以内所有质数（素数）

//使用删除法求质数（1000以内）
static void primer(void)
{
    
    	
	int i = 0, j = 0;
	char primer[1001] = {
    
    0};
	for(i = 2; i < 1001; i++)
	{
    
    
		if(primer[i] == 0)
		{
    
    
			for (j = i*2; j < 1001; j+=i)	
				primer[j] = -1;
		}
	}
	for (i = 2; i < 1001; i++)
		if(primer[i] == 0)
		{
    
    
			printf("%d is a primer.", i);
		}
	return;
}