大一c语言课程设计报告及源代码,c语言课程设计报告

1,c语言课程设计报告并命名为PersonInfo.txt【大一c语言课程设计报告及源代码,c语言课程设计报告】
2,c语言课程设计 1121314110的程序编写#include "stdio.h"main() int flag=1; float sum=0,i; for(i=1;i<=10;i++)sum+=(1/i)*flag; flag=-flag; } printf("%f ",sum);}c语言源程序:#include "stdio.h"void main() int i, n; int f = 1; /* 符号 */ double sum; /* 各项之和 */ printf("input value of n : "); scanf("%d", &n); sum = 0.0; for(i=1; i<=n; i++) sum += 1.0 * f / i; f *= -1; /* t 在正负1之间切换 */ } printf("1-1/2+1/3-1/4+ ... +-1/n = %lf", sum);}运行测试:
3 , 大一C语言设计现在我把起泡排序和选择排序写在一起,并且把它们的运算的先后顺序也在运行结果中显示出来 , 便于你理解:#include<stdio.h>int main()void pao(int[],int);void pai(int[],int);int nums[81],num[81],N,k;printf("输入你要判断的数的个数\n");scanf("%d",&N);printf("请输入起泡排序要排列的%d个数\n",N);for(k=0;k<N;k++)scanf("%d",&nums[k]);printf("请输入选择排序要排列的%d个数\n",N);for(k=0;k<N;k++)scanf("%d",&num[k]);printf("起泡排序:\n");pao(nums,N);printf("选择排序:\n");pai(num,N);return 0;}void pao(int nums[],int w)int i,j,change,a,n=1;for(i=0;i<(w-1);i++)for(j=1;j<w;j++)if(nums[j]>nums[j-1])change=nums[j-1];nums[j-1]=nums[j];nums[j]=change;printf("第%d步:",n++);for(a=0;a<w;a++)printf("%3d",nums[a]);printf("\n");}}}}void pai(int nums1[],int q)int x,y,z,max,s,chan,p=1;for(x=0;x<(q-1);x++)max=nums1[x];z=x;for(y=x+1;y<q;y++)if(nums1[y]>nums1[z])max=nums1[y];z=y;}}if(max>nums1[x])chan=nums1[x];nums1[x]=max;nums1[z]=chan;}printf("第%d步为:",p++);for(s=0;s<q;s++)printf("%3d",nums1[s]);printf("\n");}}运行结果如下:#include <stdio.h>void main() int j,i, a[100] , n , t; scanf("%d",&n); for(i = 0 ; i < n ; i++)scanf("%d",&a[i]) ; for(i = 0 ; i < n-1 ; i++)for(j = i+1 ; j < n ; j++)if(a[i] > a[j])t = a[i] ;a[i] = a[j] ;a[j] = t ;}for(i = 0 ; i < n ; i++)printf("%d ",a[i]) ; printf("\n") ;}这才是选择排序 。。。上面一个用的是冒泡法排序吧》》》#include <stdio.h>void main()int j,i, a[100] , n , t, min;scanf("%d",&n);for(i = 0 ; i < n ; i++)scanf("%d",&a[i]) ;for(i = 0 ; i < n-1 ; i++) min = i;for(j = i+1 ; j < n ; j++)if(a[j] > a[min])t = a[i] ;a[i] = a[min] ;a[min] = t ;}for(i = 0 ; i < n ; i++)printf("%d ",a[i]) ;printf("\n") ;} #include "stdlib.h" #include "stdio.h" void select_sort(int data[],int start_index,int data_num)int temp,*a;int min_index,j;while(start_index<=data_num-1)for(j=start_index; j<data_num; j++)if(data[min_index]>data[j]) } temp = data[start_index]; data[start_index] = data[min_index]; data[min_index] = temp; start_index++; }for (j=0;j<data_num;j++)a[j]=data[data_num-j-1]; } for (j=0;j<data_num;j++)data[j]=a[j]; }} void main(void)printf("输入数的个数:\n");scanf("%d",&N); printf("输入%d个数:\n",N); for(i=0;i<N;i++) select_sort(a,0,N);printf("\n"); for(i=0;i<N;i++)printf("\n"); getch();}

    推荐阅读