文件名称:shunxubiao-and-lianbiao
介绍说明－－下载内容均来自于网络，请自行研究使用
(1)．对于顺序存储的线性表，请实现以下功能：
1）实现二路归并排序算法。
2）实现快速排序算法。
3）实现堆排序算法。
4）实现冒泡排序和选择排序算法
(2)．已知长度为n的线性表A采用顺序存储结构，请写一时间复杂度为0(n)、空间复杂度为0(1)的算法，该算法删除线性表中所有值为item的数据元素。要求：线性表元素个数n很大，而值为item的数据元素个数很少，要求移动元素个数尽量少；删除后的数组元素与原数组元素不必保持顺序一致。
(3)．编写一个主函数,调试上述算法。注：需要额外设计一个线性表初始化的函数。
(4). 对上述五个排序算法，使用两个长度为一千万的线性表分别测试其性能，记录其运行时间（生成线性表的时间不计算在内）。第一个：线性表内的元素值随机生成；第二个：线性表的第i个元素值为i，即本来就有序。-( 1 ) . For linear sequence of storage table, the following functions:
1 ) to achieve two-way merge sort algorithm .
2 ) fast sorting algorithm.
3 ) to achieve heap sort algorithm.
4 ) to achieve bubble sort and selection sort algorithm
( 2 ) . Known linear meter of length n A sequential storage structure , please write a time complexity of 0 (n), space complexity is O (1 ) of the algorithm, which deletes all the values of the linear form item data elements . Requirements: linear form n large number of elements , while the number of elements is very little data item , and the number of elements required to move as little as possible array elements deleted after the original order of the array elements do not have to be consistent .
( 3 ) . Write a main function, debug these algorithms. Note : requires additional design a linear table initialization function .
( 4 ) For the five sorting algorithms , using two lengths of ten million linear tables were tested for pe
1）实现二路归并排序算法。
2）实现快速排序算法。
3）实现堆排序算法。
4）实现冒泡排序和选择排序算法
(2)．已知长度为n的线性表A采用顺序存储结构，请写一时间复杂度为0(n)、空间复杂度为0(1)的算法，该算法删除线性表中所有值为item的数据元素。要求：线性表元素个数n很大，而值为item的数据元素个数很少，要求移动元素个数尽量少；删除后的数组元素与原数组元素不必保持顺序一致。
(3)．编写一个主函数,调试上述算法。注：需要额外设计一个线性表初始化的函数。
(4). 对上述五个排序算法，使用两个长度为一千万的线性表分别测试其性能，记录其运行时间（生成线性表的时间不计算在内）。第一个：线性表内的元素值随机生成；第二个：线性表的第i个元素值为i，即本来就有序。-( 1 ) . For linear sequence of storage table, the following functions:
1 ) to achieve two-way merge sort algorithm .
2 ) fast sorting algorithm.
3 ) to achieve heap sort algorithm.
4 ) to achieve bubble sort and selection sort algorithm
( 2 ) . Known linear meter of length n A sequential storage structure , please write a time complexity of 0 (n), space complexity is O (1 ) of the algorithm, which deletes all the values of the linear form item data elements . Requirements: linear form n large number of elements , while the number of elements is very little data item , and the number of elements required to move as little as possible array elements deleted after the original order of the array elements do not have to be consistent .
( 3 ) . Write a main function, debug these algorithms. Note : requires additional design a linear table initialization function .
( 4 ) For the five sorting algorithms , using two lengths of ten million linear tables were tested for pe
(系统自动生成,下载前可以参看下载内容)
下载文件列表
顺序表应用完成.cpp
链表的应用.cpp
数据结构课程设计个人报告.doc