26a27
>             output[i] = a;
35c36
<     parallel_for( blocked_range<int>( 0, n, n/2), par);
---
>     parallel_for( blocked_range<int>( 0, n), par, auto_partitioner());
37c38
< int main(int argc, char * argv)
---
> int main(int argc, char * argv[])
39d39
<     task_scheduler_init init;
43c43
<     const int nValues = 50000;
---
>     const int nValues = 500000;
53c53,55
<     tick_count start = tick_count::now();
---
>     tick_count start, end;
> for(int warmup=0; warmup<=1; ++warmup) {
>     start = tick_count::now();
63a66
>         pollame[i] = a;
65c68,69
<     tick_count end = tick_count::now();
---
>     // measure timings
>     end = tick_count::now();
66a71,74
>     cout << "time serial (run " << warmup << ") = " << totalTimeSerial  << endl;
> }
> for(int nthread=2; nthread<=8; ++nthread) {
>     task_scheduler_init init(nthread);
73,75c81,82
<     // measure timings
<     cout << "time serial = " << totalTimeSerial  << endl;
<     cout << "time parallel = " << totalTimeParallel << endl;
---
>     cout << "time parallel (" << nthread << " threads) = " << totalTimeParallel << endl;
> }