[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fycmOLv8m2LhMmpRILm9mv_TdpO0XDylL-jg9TwrJE0g":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-12-25 17:09:32",173932575,[8,9,10,11],"7","14","21","49",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},10,"aaa761014bc327f736e6ca2cff3e442c","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F808dfeb8ccbbda09f299cabbf0d78071.png","算法分析与设计","work_39861465","第4次作业","对于7个数进行冒泡排序,最坏情况下需要进行的比较次数为( )",[21,32,41,44,53,58,67,76,85,94],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],173932571,[25,26,27,28],"N(logN)2","N2logN","N3","Nlog(N2)","下列函数中,哪个函数具有最快的增长速度( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],173932573,[36,37,38,39],"ABDFECG","ABDEFCG","ABDFEGC","ABCDEFG","已知一个二叉树的后序和中序遍历的结果分别是FDEBGCA和FDBEACG,那么该二叉树的前序遍历结果是什么( )",{"answer":42,"createTime":5,"id":6,"options":43,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":30,"type":31},[],173932577,[48,49,50,51],"A)name=liming,old=18","B)name=wanghua,old=19","C)name=zhangping,old=20","D)name=hanpeng,old=21","有如下程序 struct man { char name[20]; int age; }person[]={"liming",18,"wanghua",19,"zhangping",20,"hanpeng",21}; int main(void) { int old; struct man *p=person,*q; q=p; old=p->age; for(;p<=&person[3];p++) if(old<p->age) { q=p; old=p->age; } printf("name=%s,old=%d\\n",q->name,q->age); } 程序的运行结果为( )",{"answer":54,"createTime":5,"id":55,"options":56,"question":57,"source":30,"type":31},[],173932579,[48,49,50,51],"有如下程序 struct man { char name[20]; int age; }person[]={"liming",18,"wanghua",19,"zhangping",20,"hanpeng",21}; int main(void) { int old; struct man *p=person,*q; q=p; old=p->age; for(;p<=&person[3];p++) if(old>p->age) { q=p; old=p->age; } printf("name=%s,old=%d\\n",q->name,q->age); } 程序的运行结果为( )",{"answer":59,"createTime":5,"id":60,"options":61,"question":66,"source":30,"type":31},[],173932581,[62,63,64,65],"12","27","36","都不是","一段文本中包含对象{ a,b,c,d,e},其出现次数相应为{ 3,2,4,2,1 },则经过哈夫曼编码后,该文本所占总位数为( )",{"answer":68,"createTime":5,"id":69,"options":70,"question":75,"source":30,"type":31},[],173932583,[71,72,73,74],"31","39","63","71","如果一个完全二又树最底下一层为第六层(根为第一层) 且该层共有8个叶结点,那么该完全二叉树共有多少个结点( )",{"answer":77,"createTime":5,"id":78,"options":79,"question":84,"source":30,"type":31},[],173932585,[80,81,82,83],"PPOPPOOOPO","POPPOPPOOO","POOPPPOPOO","PPPOOPOPOO","题单选如果一堆栈的输入序列是aAbBc,输出abcBA,那么该堆栈所进行的操作序列是什么?设P代表入栈,O代表出栈.( )",{"answer":86,"createTime":5,"id":87,"options":88,"question":93,"source":30,"type":31},[],173932587,[89,90,91,92],"A) a=9,b=5","B) a=5,b=9","C) a=10,b=6","D) a=6,b=10","有下列程序 # include <stdio.h> void fun1(int *x,int *y) { int *z; z=x; x=y; y=z; } void fun2(int *x,int *y) { int z; z=*x; *x=*y; *y=z; (*x)++; (*y)++; } void main() { int a=5,b=9; fun1(&a,&b); printf("a=%d,b=%d\\n",a,b); fun2(&a,&b); printf("a=%d,b=%d\\n",a,b); } main函数中第一个printf输出结果为( )",{"answer":95,"createTime":5,"id":96,"options":97,"question":99,"source":30,"type":31},[],173932591,[98,90,91,92],"A)a=9,b=5","有下列程序 # include <stdio.h> void fun1(int *x,int *y) { int *z; z=x; x=y; y=z; } void fun2(int *x,int *y) { int z; z=*x; *x=*y; *y=z; (*x)++; (*y)++; } void main() { int a=5,b=9; fun1(&a,&b); printf("a=%d,b=%d\\n",a,b); fun2(&a,&b); printf("a=%d,b=%d\\n",a,b); } main函数中第二个printf输出结果为( )"]