重新结合:编程时,重新设置运算的结合顺序,会带来性能的提升。因为结合顺序的不同,对应的操作顺序也会不同。
例如:
a = a*b[i]*b[i + 1],操作流程如图:
a = a*(b[i]*b[i + 1]),操作流程图如下:
实例代码:
long long getSystemTime() {
struct timeb t;
ftime(&t);
return 1000 * t.time + t.millitm;
}
int main()
{
int * b_test_data = (int *)malloc(80000000*sizeof(int));
int b_loop;
long long b_begin, b_end, b_ttl1 = 1, b_ttl2 = 1;
for(b_loop = 0; b_loop < 80000000; b_loop++)
{
b_test_data[b_loop] = 1;
}
b_begin = getSystemTime();
for(b_loop = 0; b_loop < 80000000 - 1; b_loop += 2)
{
b_ttl1 = b_ttl1*b_test_data[b_loop]*b_test_data[b_loop + 1];
}
for(; b_loop < 80000000; b_loop++)
{
b_ttl1 = b_ttl1*b_test_data[b_loop];
}
b_end = getSystemTime();
printf("time = %lu, b_ttl = %lu\n", b_end - b_begin, b_ttl1);
return 0;
}
运行结果:
重新设置结合顺序:
int main()
{
int * b_test_data = (int *)malloc(80000000*sizeof(int));
int b_loop;
long long b_begin, b_end, b_ttl1 = 1, b_ttl2 = 1;
for(b_loop = 0; b_loop < 80000000; b_loop++)
{
b_test_data[b_loop] = 1;
}
b_begin = getSystemTime();
for(b_loop = 0; b_loop < 80000000 - 1; b_loop += 2)
{
b_ttl1 = b_ttl1*(b_test_data[b_loop]*b_test_data[b_loop + 1]);
}
for(; b_loop < 80000000; b_loop++)
{
b_ttl1 = b_ttl1*b_test_data[b_loop];
}
b_end = getSystemTime();
printf("time = %lu, b_ttl = %lu\n", b_end - b_begin, b_ttl1);
return 0;
}
运行结果: