网站大量收购独家精品文档,联系QQ:2885784924

程序填空5(国外英语资料).doc

  1. 1、本文档共30页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
程序填空5(国外英语资料)

程序填空5 41, a given program, the function is the function of fun: call random function to produce 20 on each other is not the same integer parameter referred to in a array (this array has been put in the main function 0). Please put the correct content in the underline of the program and remove the underline and make the program correct. Note: the source program is stored in the file under the test folder. Do not add line or delete line, also cannot change program structure! # include stdlib.h # define N 20 Void fun (int * a) {int I, x, n = 0; X = rand () % 20; The found * * * * * * * While (n __1__) {for (I = 0; I n; I + +) The found * * * * * * * If (x = = a) __2__; The found * * * * * * * If (I = = __3__) {a [n] = x; N++; } X = rand () % 20; } } The main () {int. Fun (x); Printf ( The result: \ n ); For (I = 0; I N; I + +) {printf ( % 4d , x [I]); If ((I + 1) % 5 = = 0) printf ( \ n ); } Printf ( \ n \ n ); } (1) N (2) break (3) N In a given program, the function of the function fun is to sequence data from a one-way linked list node data domain of a non-leader node. If the data domain of the original linked list node data is 10, 4, 2, 8, 6, the data field of the chain table node data is 2, 4, 6, 8, 10. Please put the correct content in the underline of the program and remove the underline and make the program correct. Note: the source program is stored in the file under the test folder. Do not add line or delete line, also cannot change program structure! # include stdio.h # include stdlib.h # define N 6 Typedef struct node { The int data; Struct node * next; } the NODE; Void fun (NODE * h) {NODE * p, * q; Int t; P = h; While (p) { The found * * * * * * * Q = __1__; The found * * * * * * * While (__2__) {if (p- data q- data) {t = p- data; P- data = q- data; Q- data = t; } Q = q- next; } The found * * * * * * * P = __3__; } } NODE * creatlist (int a []) {NODE * h, * p, * q; Int I; H = NULL; For (I = 0; I N; I + +) (NODE *) malloc (sizeof (NODE)); Q- data

文档评论(0)

jgx3536 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档