For my code above, how do I display the number of times the basic operation (comparison) was executed in the sorting algorithm C++? And how do I find patterns for best case and worst case?

1 #include 2 3 using namespace std; 4 5 void insertionSort(int arr[], int n) 6 { 7 int i, key, j; 8 for (i = 1; i = 0 && arr[j] > key) 14 { 15 arr[j + 1] arr[j]; 16 j = j 1; 17 } 18 arr(j + 1] = key; 19 for(int k = 0; k > n; 38 int arr[n]; 39 cout > arr[i]; 43 } 44 45 insertionSort(arr, n); 46 cout