I would like to use parallel_sort in my project and have couple of questions.
1) is the implementation the bitonic sort? otherwise what's the complexity? taking also into account the number of available cores or threads
2) how can I specify how many threads are available to TBB? e.g. in MKL I can say export MKL_NUM_THREADS=1 or whatever
3) Following on question 2, what kind of sequential implementation parallel_sort defaults to if the number of threads is just one? does it delegate to std::sort?