插入排序比了几次挪了几次

同一个数组跑插入排序。

运行下面这段程序：

#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;

int main() {
    vector<int> b = {17, 24, 15, 13, 23};
    int cmps = 0, moves = 0;
    for (int i = 1; i < (int)b.size(); i++) {
        int key = b[i];
        int j = i - 1;
        while (j >= 0) {
            cmps++;
            if (b[j] <= key) break;
            b[j + 1] = b[j];
            moves++;
            j--;
        }
        b[j + 1] = key;
    }
    cout << cmps << "/" << moves << endl;
}

（本题用 g++ -std=c++17 -O0 编译。）