writing a completely generic quick sort in c++11

I am trying to implement a generic quick sort. Basically something similar to the STL sort method which takes a compare function as the third argument for custom sorting. So if i am sorting complex objects, it should take a comparator object which defines the order of sorting. what is the c++11 way of doing this ?

Edit : I am doing this just for learning and for understanding advanced stuff in C++11. I was practicing quick sort so thought doing this as well