How do you find the iterator in the middle of two iterators?

Question

I\'m trying to convert my implementation of quicksort into a template that can be used with other containers besides a vector.

Originally I used indexes to find the

Answer 1

How about something like this?

bool isMovingFirst = true;
while(first != last) {
  if(isMovingFirst) {
    ++first;
  } else {
    --last;
  }
  isMovingFirst = !isMovingFirst;
}