fill memset, for小测试
2013-07-10 11:27
99 查看
/*很无聊写着玩玩,后来发现memset效率会比fill高出这么多,可惜一般只用来赋值0,-1.。。。。。以后可以用fill来偷偷懒了。。。*/
#include<iostream>
#include<ctime>
using namespace std;
#define max 100000000+5
int a[max];
int main()
{
time_t beg,end;
beg=clock();
cout<<"---------------------------for\n";
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 1 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 2 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 3 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 4 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 5 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 6 cost: "<<end-beg<<"MS"<<endl;
cout<<"---------------------------fill\n";
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 1 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 2 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 3 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 4 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 5 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 6 cost: "<<end-beg<<"MS"<<endl;
cout<<"---------------------------memset\n";
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 1 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 2 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 3 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 4 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 5 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 6 cost: "<<end-beg<<"MS"<<endl;
}
#include<iostream>
#include<ctime>
using namespace std;
#define max 100000000+5
int a[max];
int main()
{
time_t beg,end;
beg=clock();
cout<<"---------------------------for\n";
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 1 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 2 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 3 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 4 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 5 cost: "<<end-beg<<"MS"<<endl;
for(int i=0;i<max;i++)
{
a[i]=0;
}
end=clock();
cout<<"test 6 cost: "<<end-beg<<"MS"<<endl;
cout<<"---------------------------fill\n";
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 1 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 2 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 3 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 4 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 5 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
fill(a,a+max,0);
end=clock();
cout<<"test 6 cost: "<<end-beg<<"MS"<<endl;
cout<<"---------------------------memset\n";
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 1 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 2 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 3 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 4 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 5 cost: "<<end-beg<<"MS"<<endl;
beg=clock();
memset(a,0,sizeof(a));
end=clock();
cout<<"test 6 cost: "<<end-beg<<"MS"<<endl;
}
相关文章推荐
- 初始化测试,memset,for,fill
- 初始化测试,memset,for,fill
- fill memset for 小测试
- 谁来解答下!!memset,for,while,fill()初始化数组的效率对比...
- #215 – Other Choices for Gradient Spreads Outside the Fill Area
- fill()和fill()_n函数还有memset()函数的比较
- android真机测试报错:Please configure your build for VectorDrawa
- amoeba for mysql读写分离--亲测试
- 对于变长for-in的测试
- fill 与memset 给整个数组赋值
- docker技术剖析--中小企业可以用docker来标准化开发、测试、生产环境 for centos7.2
- java的for下标循环遍历和foreach循环遍历测试
- memset另类初始化测试(部分数字有注释)
- C++中的FILL和MEMSET(zzl) 的区分
- httpclient for java 测试openstack swift
- Lync 项目经验-27-SFB 2016(单独安装)-For-Windows 7-测试成功
- 学习EJB for JBoss 3.2笔记(2)测试jsp
- tlplayer for ios V1.1.1加密测试版本
- Open NI for Kinect安装测试
- 测试简单for循环的效率