title: Sorting in C++ distributed across several frames
body: <p>In the game I'm working on, I have a large amount of data stored in a vector that I would like to sort, but w/o impacting the performances of the game during that operation.
  So is there (in the STL or others) an asynchronous algorithm allowing to sort any vector of data with a limited number of comparisons per frame (each requiring some computation), and providing the result after X frames of computation?</p>