C语言基础编程试题案例.pdf
上传人:qw****27 上传时间:2024-09-12 格式:PDF 页数:12 大小:78KB 金币:15 举报 版权申诉
预览加载中,请您耐心等待几秒...

C语言基础编程试题案例.pdf

C语言基础编程试题案例.pdf

预览

免费试读已结束,剩余 2 页请下载文档后查看

15 金币

下载此文档

如果您无法下载资料,请参考说明:

1、部分资料下载需要金币,请确保您的账户上有足够的金币

2、已购买过的文档,再次下载不重复扣费

3、资料包下载后请先用软件解压,在使用对应软件打开

1、数组元素逆序输出;//1.#include<stdio.h>voidprint(int*arr_p,intn){inti;for(i=n-1;i>=0;i--){printf("%d",arr_p[i]);}}intmain(){intn,i;scanf("%d",&n);intarr[n];for(i=0;i<n;i++){scanf("%d",&arr[i]);}print(arr,n);return0;}2、数组元素逆序保存;//2.#include<stdio.h>voidturn_save(int*arr_p,intlen){inti,temp;for(i=0;i<len/2;i++){temp=arr_p[i];arr_p[i]=arr_p[len-i-1];arr_p[len-i-1]=temp;}}intmain(){intn,i;scanf("%d",&n);intarr[n];for(i=0;i<n;i++)scanf("%d",&arr[i]);turn_save(arr,n);for(i=0;i<n;i++)printf("%d",arr[i]);return0;}3、数组元素删除;//3.#include<stdio.h>intdelete(int*arr,intlen,intdelete_num){inti,j;for(i=0;i<len;i++){if(delete_num==arr[i]){for(j=i+1;j<len;j++){arr[j-1]=arr[j];}len--;i--;}}returnlen;}intmain(){intarr[]={-1,-1,1,1,3,4,4,5,7,9,9};inti;intlen=sizeof(arr)/sizeof(arr[0]);intdelete_num;scanf("%d",&delete_num);len=delete(arr,len,delete_num);for(i=0;i<len;i++){printf("%d",arr[i]);}return0;}4、数组元素插入;4.//notice#include<stdio.h>voidinsert(int*arr,intlen,intinsert_num){inti,j;for(i=0;i<len-1;i++){if(insert_num<arr[i]){for(j=len-2;j>=i;j--){arr[j+1]=arr[j];}arr[i]=insert_num;break;}}if(insert_num>=arr[len-2]){arr[len-1]=insert_num;}}intmain(){intarr[8]={-2,1,3,5,7,9,11};intlen=sizeof(arr)/sizeof(arr[0]);inti;intinsert_num;scanf("%d",&insert_num);insert(arr,len,insert_num);for(i=0;i<len;i++){printf("%d",arr[i]);}return0;}5数组元素循环n个;5.#include<stdio.h>voidcirculate(int*arr,intlen,intn){inti,count;inttemp;for(count=0;count<n;count++){temp=arr[len-1];for(i=len-2;i>=0;i--){arr[i+1]=arr[i];}arr[0]=temp;}}intmain(){intarr[]={1,2,3,4,5,6};intlen=sizeof(arr)/sizeof(arr[0]);inti;intn;scanf("%d",&n);circulate(arr,len,n);for(i=0;i<len;i++){printf("%d",arr[i]);}return0;}6.冒泡排序6.#include<stdio.h>voidbubble_sort(int*arr,intlen){inti,j;inttemp;for(i=0;i<len-1;i++){for(j=0;j<len-i-1;j++){if(arr[j]>arr[j+1