数据结构课程设计报告(万春晖).docVIP

课程设计报告 课程设计题目： 各种内部排序性能比较 学生姓名 万春晖 专 业 软件工程 课 程 数据结构 班 级 071105 学 号 指导教师 许志文 2009年5月14日 摘 要 该程序是用C++语言实现的，在程序中随机生成N个数据，对这些数进行多种方法的排序，所用的这些排序方法都是在数据结构课中学习过的比如：插入排序、快速排序、冒泡排序等，而且还要对各个排序做出相应的比较。 该演示程序以用户和计算机的对话方式执行，每次测试完毕，列表显示各种比较指标值。 最后对结果作出了简单分析并将结果排序，包括对各组数据得出结果波动大小给予解析。 关键字：插入排序、快速排序、选择排序、冒泡排序、比较的个数、改变的个数、所用的时间。 目 录 摘要·················································Ⅰ 目录·················································Ⅱ 问题描述··········································1 题目内容······································1 基本要求······································1 测试数据······································1 需求分析··········································2 输入输出的形式和输入值的范围··················2 程序所能达到的功能····························2 概要设计··········································3 程序所需的抽象数据类型························3 系统功能模块··································3 外部功能模块图································ 3 主函数功能模块图·······························3 详细设计···········································4 4.1 整个程序的流程图··································4 4.2 插入排序及其主要代码······························5 4.3 二路合并排序及其主要代码··························6 4.4 冒泡排序及其主要代码······························7 4.5 快速排序及其主要代码······························8 4.6 选择排序及其主要代码······························9 5 调试分析···········································10 5.1 主界面 ···········································11 5.2 计算中的程序界面··································12 5.3 排序结束后的界面··································13 5.4 调试分析结果······································14 6 总结···············································15 1问题描述 1.1题目内容 本演示程序对以下5种常用的内部排序算法进行实测比较：起泡排序、直接插入排序、简单选择排序、快速排序、二路合并排序。 主要工作是设法在已知算法中的适当位置插入对关键字的比较次数和移动次数的计数操作。程序还可以考虑几组数据的典型性，如：正序、逆序和不同程度的乱序。注意采用分块调试的方法。 1.2基本要求 1． 待排序表的表长不小于100，其中数据要用的随机数产生程序产生，至少要用5组不同的输入数据体比较，比较的指标为：有关键字参加的比较次数和关键字的移动次数（关键字交换计为3次的移动）。 2． 演示程序以用户和计算机的对话方式执行，即在计算机终端上显示“提示信息”下，用户可由键盘输入待排序表的表长和不同的测试数据的数组，每次测试完毕，列表显示各种比较指标值。 3．最后对