| 排序算法比较程序 |
| 责任编辑：admin 更新日期：2005-8-6 |
goto start;
case 2:
if(LOCK42==0) goto start;
for (r=1;r<=LQ.length;r++)
printf("%d",LQ.key[r]);
printf("\n PRESS ANY KEY TO RETURN MAIN MENU... \n");
getch();
goto start;
case 3:
if(LOCK43==0) goto start;
for (r=1;r<=LH.length;r++)
printf("%d",LH.key[r]);
printf("\n PRESS ANY KEY TO RETURN MAIN MENU... \n");
getch();
goto start;
case 4:
if(LOCK44==0) goto start;
for (r=1;r<=LM.length;r++)
printf("%d",LM.key[r]);
printf("\n PRESS ANY KEY TO RETURN MAIN MENU... \n");
getch();
goto start;
case 6:
goto start;
}
case 5:
if(LOCK5==0) goto start;
menusave(&comd);
switch (comd)
{
case 1:
if(LOCK41==0) goto start;
save(LS);
break;
case 2:
if(LOCK42==0) goto start;
save(LQ);
break;
case 3:
if(LOCK43==0) goto start;
save(LH);
break;
case 4:
if(LOCK44==0) goto start;
save(LM);
break;
case 6:
break;
}
break;
case 6:
exit(0);
}
}
} |
| |
上一页 [1] [2] [3] [4]
|
| 上一篇文章： 霍夫曼树编码的实现 |
| 下一篇文章： TList |
|
|
|
|
