程序填空5(Fill in the blanks 5).doc

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

程序填空5(Fill in the blanks 5) 41, in a given program, the function fun function is: call the random function to produce 20 different integers, placed in the parameter a index group (this array in the main function has been set 0). Please fill in the correct content at the underline of the program and delete the underscore so that the program can get the correct result. Note: the source is stored in the BLANK1.C folder under the examinee folder. No lines can be added or deleted, nor shall the programs structure be altered! #include stdlib.h #define N 20 Void fun (int *a) {int, I, x, n=0; X=rand ()%20; /**********found**********/ While (n__1__) {for (i=0; in; i++) /**********found**********/ If (x==a[i]) __2__; /**********found**********/ If (i==__3__) {a[n]=x; n++;} X=rand ()%20; } } (main) {int, x[N]={0}, i; Fun (x); Printf (The result: \n); For (i=0; iN; i++) {printf (%4d, x[i]); If ((i+1)%5==0) printf (\n); } Printf (\n\n); } (1) N (2) break (3) n 42, given a program, the function of fun is to not take the lead node of the one-way linked list, node data in the domain of data from small to large order. If the original node data list data domain from first to last for 10, 4, 2, 8, 6, After sorting the list node data field data from first to last for 2, 4, 6, 8, 10. Please fill in the correct content at the underline of the program and delete the underscore so that the program can get the correct result. Note: the source is stored in the BLANK1.C folder under the examinee folder. No lines can be added or deleted, nor shall the programs structure be altered! #include stdio.h #include stdlib.h #define N 6 Typedef, struct, node { Int data; Struct node *next; } NODE; Void fun (NODE *h) {NODE, *p, *q; int t; P = h; While (P) { /**********found**********/ Q = __1__; /**********found**********/ While (__2__) {if (p-data q-data) {t = p-data; p-data = q-data; q-data = t;} Q = q-next; } /**********found**********/ P = __3__; } } NODE *creatlist (int a[]) {NODE, *h, *p, *q; int

您可能关注的文档

文档评论(0)

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

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

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档