// 乘法口诀表 //
#include<stdio.h> #include<windows.h> void Mul(int input ) { int i = 0; for(i=1;i<=input;i++) { int j = 0; for(j=1;j<=i;j++) { printf("- * - == ",j,i,j*i); } printf("\n"); } } int main() { int input = 0; printf("请输入:"); scanf("%d",&input); Mul(input); system("pause"); return 0; }
// 交换两个数 //
#include<stdio.h> #include<windows.h> void swap(int* x,int* y) { int tmp = *x; *x = *y; *y = tmp; } int main() { int a = 10; int b = 20; swap(&a,&b); printf("%d %d\n",a,b); system("pause"); return 0; }
// 闰年判断函数 //
#include<stdio.h> #include<windows.h> int leap_year(int year) { if(((year%4==0)&&(year0!=0))||((year@0==0)==1)) { return 1; } else { return 0; } } int main() { int ret = 0; int year = 0; printf("请输入年份:"); scanf("%d",&year); ret = leap_year(year); if(ret == 1) { printf("%d is a leap_year\n",year); } else { printf("%d is not a leap_year\n",year); } system("pause"); return 0; }
// 数组初始化，逆置，清空 //
#include<stdio.h> #include<windows.h> void init(int arr[],int len)//初始化数组 { int i = 0; int num = 0; printf("初始化数组，请输入5个数:\n"); for(i=0;i<len;i++) { scanf("%d",&num); arr[i] = num; } } void empty(int arr[],int len)//清空数组 { int i = 0; printf("清空数组:\n"); for(i=0;i<len;i++) { arr[i] = 0; } } void reverse(int arr[],int len)//逆置数组 { int i = 0; int arr2[10]; printf("逆置数组:\n"); for(i=0;i<len;i++) { arr2[i] = arr[i]; } for(i=0;i<len;i++) { arr[i] = arr2[len-1-i]; } } int main() { int i = 0; int arr[5] = {0}; int len = sizeof(arr)/sizeof(arr[0]); init(arr,len); reverse(arr,len); for(i=0;i<len;i++) { printf("%d ",arr[i]); } printf("\n"); empty(arr,len); for(i=0;i<len;i++) { printf("%d ",arr[i]); } printf("\n"); system("pause"); return 0; }
// 二分查找 //
#include<stdio.h> #include<windows.h> int binary_search(int arr[],int key,int left,int right) { int mid = 0; while(left<=right) { int mid = (left+right)>>1; if(arr[mid]<key) { left = mid+1; } else if(arr[mid]>key) { right = mid-1; } else { return mid; } } return -1; } int main() { int arr[] = {1,3,5,7,9,11,12,13}; int key = 5; int left = 0; int right = sizeof(arr)/sizeof(arr[0])-1; int ret = binary_search(arr,key,left,right); if(ret==-1) { printf("找不到\n"); } else { printf("%d\n",ret); } system("pause"); return 0; }
