尝试了一下C++17的并行STL排序,速度提升比较明显。
环境是VS2019。
#include <algorithm>
#include <execution>
#include <iostream>
#include <random>
#include <chrono>
using namespace std;
using namespace chrono;
int main()
{
vector<long long> d1(30000000);
vector<long long> d2(30000000);
mt19937 gen;
uniform_int_distribution<long long> dis(0, 100000000);
auto rand_num([=]() mutable { return dis(gen); });
generate(execution::par, begin(d1), end(d1), rand_num);
d2 = d1;
auto start_t = high_resolution_clock::now();
sort(begin(d1), end(d1));
auto end_t = high_resolution_clock::now();
auto duration = duration_cast<nanoseconds>(end_t - start_t);
cout << "The run time is: " << double(duration.count()) * nanoseconds::period::num / nanoseconds::period::den << "s" << endl;
start_t = high_resolution_clock::now();
sort(execution::par, begin(d2), end(d2));
end_t = high_resolution_clock::now();
duration = duration_cast<nanoseconds>(end_t - start_t);
cout << "The run time is: " << double(duration.count()) * nanoseconds::period::num / nanoseconds::period::den << "s" << endl;
return 0;
}
速度对比:
原文链接: https://www.cnblogs.com/tiandsp/p/14231385.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/206897
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!