文件名称:main
介绍说明－－下载内容均来自于网络，请自行研究使用
1）实现二路归并排序算法。
2）实现快速排序算法。
3）实现堆排序算法。
4）实现冒泡排序和选择排序算法
(2)．已知长度为n的线性表A采用顺序存储结构，请写一时间复杂度为0(n)、空间复杂度为0(1)的算法，该算法删除线性表中所有值为item的数据元素。要求：线性表元素个数n很大，而值为item的数据元素个数很少，要求移动元素个数尽量少；删除后的数组元素与原数组元素不必保持顺序一致。
(3)．编写一个主函数,调试上述算法。注：需要额外设计一个线性表初始化的函数。
(4). 对上述五个排序算法，使用两个长度为50万的线性表分别测试其性能，记录其运行时间（生成线性表的时间不计算在内）。第一个：线性表内的元素值随机生成；第二个：线性表的第i个元素值为i，即本来就有序。-1) achieve Merging sorting algorithms.
2) fast sorting algorithms.
3) to achieve the heap sort algorithm.
4) achieve bubble sort and selection sort algorithm
(2). Known linear meter of length n A sequential storage structure, please write a time complexity is 0 (n), the space complexity is O (1) algorithm, linear table delete all data elements value item . Requirements: n large number of elements in a linear form, with little data item of the number of elements is required to minimize the number of elements to move deleted array elements with the original order of the array elements do not have to be consistent.
(3). Write a main function, debugging these algorithms. Note: You need to design a linear list of additional initialization function.
(4) For the five sorting algorithm using two lengths of 500,000 linear meter, respectively, test its performance, recording its running time (time to generate the linear form are not counted). The first one: a linear element values within
2）实现快速排序算法。
3）实现堆排序算法。
4）实现冒泡排序和选择排序算法
(2)．已知长度为n的线性表A采用顺序存储结构，请写一时间复杂度为0(n)、空间复杂度为0(1)的算法，该算法删除线性表中所有值为item的数据元素。要求：线性表元素个数n很大，而值为item的数据元素个数很少，要求移动元素个数尽量少；删除后的数组元素与原数组元素不必保持顺序一致。
(3)．编写一个主函数,调试上述算法。注：需要额外设计一个线性表初始化的函数。
(4). 对上述五个排序算法，使用两个长度为50万的线性表分别测试其性能，记录其运行时间（生成线性表的时间不计算在内）。第一个：线性表内的元素值随机生成；第二个：线性表的第i个元素值为i，即本来就有序。-1) achieve Merging sorting algorithms.
2) fast sorting algorithms.
3) to achieve the heap sort algorithm.
4) achieve bubble sort and selection sort algorithm
(2). Known linear meter of length n A sequential storage structure, please write a time complexity is 0 (n), the space complexity is O (1) algorithm, linear table delete all data elements value item . Requirements: n large number of elements in a linear form, with little data item of the number of elements is required to minimize the number of elements to move deleted array elements with the original order of the array elements do not have to be consistent.
(3). Write a main function, debugging these algorithms. Note: You need to design a linear list of additional initialization function.
(4) For the five sorting algorithm using two lengths of 500,000 linear meter, respectively, test its performance, recording its running time (time to generate the linear form are not counted). The first one: a linear element values within
(系统自动生成,下载前可以参看下载内容)
下载文件列表
main.cpp