Quicksort using uniform_int_distribution to select the pivot
Because you are creating a generator in each iteration with the same seed, the value you get from your distribution will be the same. 

So no, this is not the correct way to use the new random subsystem in C++11. 

You need to pass in a distribution by reference to quicksort(iteratorm,iterator).

Also personally I don't feel that random numbers should be a part of a sorting algorithm because performance becomes non-deterministic. I would suggest you use one of the other pivot selection strategies.

Also your algorithm requires the use of random access iterators. Might be worth noting.