作业帮 > 英语 > 作业

Project6:Performances Measurement of Sorting Algorithms

来源:学生作业帮 编辑:作业帮 分类:英语作业 时间:2024/07/14 23:27:29
Project6:Performances Measurement of Sorting Algorithms
1.Problems
1.Sortthe list by InsertionSort,QuickSort,MergeSort and HeapSort,respectively.And write everypass result of them.
Input:(a list)
26 5 37 1 61 11 59 15 48 19
Output :the every pass result of them.
Notes:you should print the original list,every pass result and the last results.
2.Measure performances of InsertionSort,ShellSort,QuickSort,MergeSort and HeapSort for random data.
2.Steps andrestrict conditions
(1).Implement functions of InsertionSort,QuickSort,MergeSortand HeapSort .
(2).Output every pass result of inputlist L={26 5 37 1 61 11 59 15 48 19}by execute these functions.
(3).Analyze the worst casecomplexities of all above algorithms;
(4).Measure performances ofthe above functions for = 100,500,1000,2000,4000,5000,10000,20000.
You may userandom library function to create the testing data firstly.Second,sort itusing above algorithms alternately.Finally,measure their performances.
To generate a list random data,we may useC’s standard library stdlib.h as the following:
Note:
Yourprogram must read from a file “input.txt” and write to a file “output.txt” inthe current directory.
求C或C++代码,不是翻译······
你先给我翻译出来吧.
再问: 问题1。
1。sortthe insertionsort快速排序,归并排序列表,排序,分别。写他们everypass结果。
输入:(列表)
26 5 37 1 61 11 59 15 48 19
输出:他们的每一个通过的结果。
注:你应该打印原始列表,每一个通过的结果和最后的结果。
再答: 是不是输入的那些数,输出每一趟快速排序后的结果和每一趟归并排序的结果????
再问: 是的,已经私信·······主要是希尔算法
再答: 希尔算法我不会,快速排序法和归并排序法我博客里有,真心看不懂你的翻译。。。。。。
http:\\blog.csdn.net/codeblf2这是我的博客地址 你去看看吧。。。。。或许有你想要的东西。。。