今天突然想温习一下基本的数据算法,就把一些基本的排序算法翻出来玩一玩,并实战看看他们的效率到底如何?当然了教科书都说的背得好好的,纯粹玩玩
在测试的时候,却出现了个问题,就是如果我直接用DateTime.Now来记录运行前后的时间差来看他们谁块谁慢的话,由于测试的数据是随机生成的,量少的时候,DateTime.Now的差竟然是零,真够头疼,网上G了一下,才发现DateTime.Now是最笨的方法,有人推荐用Environment.TickCount,但更好的选择是QueryPerformanceFrequency和QueryPerformanceCounter两个win32函数,事例代码如下,得到效果果真不错
下面是一位大大写的代码,小弟借来用一下
class
TestClass
... {
[System.Runtime.InteropServices.DllImport("Kernel32.dll")]
static extern bool QueryPerformanceCounter(ref long count);
[System.Runtime.InteropServices.DllImport("Kernel32.dll")]
static extern bool QueryPerformanceFrequency(ref long count);
[STAThread]
static void Main(string[] args)
...{
long count = 0;
long count1 = 0;
long freq = 0;
double result = 0;
QueryPerformanceFrequency(ref freq);
QueryPerformanceCounter(ref count);
//需要测试的模块
QueryPerformanceCounter(ref count1);
count = count1 - count;
result = (double) (count) / (double) freq;
Console.WriteLine("模块运行试件: {0} 秒", result);
Console.ReadLine();
}
}
... {
[System.Runtime.InteropServices.DllImport("Kernel32.dll")]
static extern bool QueryPerformanceCounter(ref long count);
[System.Runtime.InteropServices.DllImport("Kernel32.dll")]
static extern bool QueryPerformanceFrequency(ref long count);
[STAThread]
static void Main(string[] args)
...{
long count = 0;
long count1 = 0;
long freq = 0;
double result = 0;
QueryPerformanceFrequency(ref freq);
QueryPerformanceCounter(ref count);
//需要测试的模块
QueryPerformanceCounter(ref count1);
count = count1 - count;
result = (double) (count) / (double) freq;
Console.WriteLine("模块运行试件: {0} 秒", result);
Console.ReadLine();
}
}
这样的得到精确率可以得到小数位后十来位,真够爽的哦