standard C++ STL sort function the number of comparison

[haofannaaa]

我想改一下啊我的code， 然后它 能算出 the total number of comparison the standard c++ sort function does
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdlib>
void test(){
vector<int> vecnum{5, 7, 4, 2, 8, 6, 1, 9, 0, 3};
struct{

void operator()(int a, int b){
static int counter=0;
counter++;
cout << counter <<endl;

}

}mycount;
sort(vecnum.begin(),vecnum.end(), mycount);

cout << "\n";
}

[haofannaaa]

可是我只想要总comparison。所以最后compile完以后，只要出一个数（总的comparison）

[ipqtjmqj]

mycount的类型不对,改成下面这样子

bool mycount(int a, int b){
            static int counter=0;
              counter++;
            std::cout << counter << std::endl;
	return a < b;
}

[ipqtjmqj]

struct {
bool operator()(int a, int b){
            static int counter=0;
              counter++;
            std::cout << counter << std::endl;
	return a < b;
}
}mycount;

这样也是可以的

[GKatHere]

struct MYCOUNT{ 
		int* counter;
		bool operator()(int a, int b){
			(*counter)++;
			return a <b;
		}
	};
	int counter =0;
	MYCOUNT mycount = {&counter};

这样无静态变量