资 源 简 介
快速排序与交换排序算法比较
在Visual C++中建立一个单文档Windows应用程序，并实现下述功能：
运用随机函数自动生成一定规模的测试数据 (10000个测试元素)，并输出到文件中。
分别执行快速排序算法和交换排序算法对测试数据排序，并输出到不同的文件中。
使用较为精确的QueryPerformanceCounter和QueryPerformanceFrequency等函数记录算法耗时，精确到毫秒，以便更好地进行算法耗时比较。
分析两种不同算法，有针对性地设计与调整测试数据，进而通过比较算法耗时来得到更充分且更深刻的认识。
编写模块校验两种不同排序算法的输出结果正确且相同
-Quicksort sorting algorithm comparison and exchange
In the Visual C++ to create a single document Windows application, and to achieve the following functions:
The use of random function automatically generates a certain amount of test data (10000 test elements), and output to a file.
Respectively, and the exchange of the implementation of quick sort algorithm sorting algorithm to sort of test data, and output to a different file.
Using a more accurate record of QueryPerformanceCounter and QueryPerformanceFrequency algorithms such as time-consuming functions, accurate to the millisecond, in order to better carry out time-consuming compared algorithms.
Analysis of two d
文 件 列 表
Jane
res
Debug
CheckModule.cpp
CheckModule.h
DataBase.cpp
DataBase.h
DialogProgress.cpp
DialogProgress.h
DialogTableSet.cpp
DialogTableSet.h
DialogTestCount.cpp
DialogTestCount.h
Flag.cpp
Flag.h
Jane.aps
Jane.cpp
Jane.h
Jane.ncb
Jane.rc
Jane.reg
Jane.sln
Jane.suo
Jane.vcproj
Jane.vcproj.Jiangfeng.Administrator.user
JaneDoc.cpp
JaneDoc.h
JaneView.cpp
JaneView.h
MainFrm.cpp
MainFrm.h
QuickSort.cpp
QuickSort.h
Random.cpp
Random.h
ReadMe.txt
resource.h
stdafx.cpp
stdafx.h
SwapSort.cpp
SwapSort.h
TableHander.cpp
TableHander.h
Timer.cpp
Timer.h
Tool.cpp
Tool.h
