如何使用chrono来查看我的排序算法每次迭代需要多长时间？

#include <iostream>
#include <chrono>

void bubbleSort(int arr[], int n) {
    for (int i = 0; i < n-1; i++) {
        for (int j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                std::swap(arr[j], arr[j+1]);
            }
        }
    }
}

int main() {
    int arr[] = {64, 34, 25, 12, 22, 11, 90};
    int n = sizeof(arr)/sizeof(arr[0]);

    auto start = std::chrono::high_resolution_clock::now();

    bubbleSort(arr, n);

    auto end = std::chrono::high_resolution_clock::now();
    auto duration = std::chrono::duration_cast<std::chrono::microseconds>(end - start);

    std::cout << "每次迭代所需时间：" << duration.count() << " 微秒" << std::endl;

    return 0;
}