线性表逆置_11082241 周笑莉(Linear table, inverse set, _11082241, Zhou Xiaoli).docVIP

线性表逆置_11082241 周笑莉(Linear table, inverse set, _11082241, Zhou Xiaoli).doc

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
线性表逆置_11082241 周笑莉(Linear table, inverse set, _11082241, Zhou Xiaoli)

线性表逆置周笑莉(Linear table, inverse set, Zhou Xiaoli) # includes stdio.h # includes malloc.h # includes stdlib.h # includes string.h # define maxsize 1000 # define null 0 typedef struct stu {char num [20]. char name [20]; float past. char tel [20]. } datatype; typedef struct {datatype and [maxsize); / * 定义顺序表结点类型 * / int i; } sequenlist; / * 将顺序表逆置 * / void nzprintout (sequenlist * l) {int i, ri; ri = 1; printf (\ t \ t = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = \ n); for (i = l - i - 1; i = 0; i --) / * 将顺序表逆向输出 * / {printf (\ t \ tele [% d], ri). printf (% s% s \ t \ t \ t% d%.2f \ n l - and [the].num, l - and [the].name, l - and [the].scor, l - and [the].tel); ri + +; } printf (\ t \ t = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = \ n); } / * 顺序输出顺序表 * / void printout (sequenlist * l) {int i, ri; printf (\ t \ t = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = \ n); for (i = 0; i l last; i + +) (ri = i + 1; printf (\ t \ tele [% d], ri). printf (% s% s \ t \ t \ t% d%.2f \ n l - and [the].num, l - and [the].name, l - and [the].scor, l - and [the].tel); } printf (\ t \ t = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = \ n); } / * 建立顺序表 * / sequenlist * creatlist (sequenlist * l) {int ri, repeat, the; char a, b, c, d; printf (\ t \ t \ t请输入要输入的学生个数:); scanf (% d repeat). printf (\ n); printf (\ t \ t学号 姓名 成绩 电话 \ n); for (re = 0; ri repeat; ri + +) / * 输入学生的信息 * / {i = ri + 1; printf (\ t and [% d]). fflush (stdin). scanf (% s% s% f% s l - and [ri].num, l - and [ri].name, l - and [ri].scor, l - and [ri].tel); l - a + +. } printf (\ n); } / * 在顺序表中插入结点 * / int insert (sequenlist * l) {int j, i, l, d; struct stu. printf (\ t \ t \ t请输入要插入的数据个数:); scanf (% d l); for (s = 0; s l;) {printf (\ t \ t \ t请输入你要插入的位置:); scanf (% d the); if (a = = maxsize l - - 1) / * 线性表已满 * / {pr

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

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

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档