class CAnalyzeSorts
{
private:
unsigned m_CountComparisons;
public:

unsigned getCountComparisons();

// How would I implement this to "count" the comparison
// I have a ton of sorts to count - so counting each one is key
const T operator == ( T const& rh) {
}

//Other comparison operators....


/** @fn void bubbleSort(std::vector<int> &vecToSort)
@brief Sort using bubble algorithm
@param vector of elements to sort 
@return void **/
template <typename T>
	void selectionSort(std::vector<T> &vecToSort)
	{
		std::vector<T>::iterator i, j;
		
		// For each number starting at the beginning of the vecToSort [ START ... MAX ]
		for ( i = vecToSort.begin(); i != vecToSort.end(); ++i )
			// ... Look at the proceeding number until it is larger than the one we are currently looking at
			for( j = i; j != vecToSort.end(); ++j )
				// ... If the current number we were looking at is smaller than the proceeding number so swap the pair
				if (*j < *i)
					std::iter_swap(i,j);
	}
//Other sorts will be implemented...
};