TBB排序

[size=medium]#include <tbb/task_scheduler_init.h>
#include <tbb/parallel_sort.h>
#include <math.h>

int main()
{
//准备排序原料
const int N = 10;
float a[N];
float b[N];
for( int i = 0; i < N; i++ ) {
a[i] = sin((double)i);
b[i] = cos((double)i);
}
//TBB初始化
tbb::task_scheduler_init init;
//排序
tbb::parallel_sort(a, a + N);
//倒序
tbb::parallel_sort(b, b + N, std::greater<float>( ));
for(int i=0;i<N;i++)
{
printf("%.2f ",a[i]);
}
printf("\n");
for(int i=0;i<N;i++)
{
printf("%.2f ",b[i]);
}
printf("\n");
return 0;
} [/size]