HOW TO OUTPUT COMPARISON TIMES AND MOVEMENT TIMES REQUIRED BY HALF INSERTION SORT USING C++?

Question

Trying to find the comparison times and movement times for a randomly generated array of fixed size required by HALF INSERTION SORT. Found a code base to do the sorting but