1、设计一个求解最大元素和最小元素的高效算法,并在随机产生的10个1~20整数中实现最大、最小值寻找; 2、统计元素之间的比较次数,并求出执行10次调用算法的平均比较次数的程序流程图

以下是求解最大元素和最小元素的高效算法的流程图：


以下是统计元素之间的比较次数，并求出执行10次调用算法的平均比较次数的程序流程图：


代码实现：

#include <iostream>
#include <cstdlib>
#include <ctime>
using namespace std;

int max_element(int arr[], int n, int& comparisons) {
    int max = arr[0];
    comparisons = 0;
    for (int i = 1; i < n; i++) {
        comparisons++;
        if (arr[i] > max) {
            max = arr[i];
        }
    }
    return max;
}

int min_element(int arr[], int n, int& comparisons) {
    int min = arr[0];
    comparisons = 0;
    for (int i = 1; i < n; i++) {
        comparisons++;
        if (arr[i] < min) {
            min = arr[i];
        }
    }
    return min;
}

int main() {
    srand(time(0));
    int arr[10];
    int total_comparisons = 0;
    for (int i = 0; i < 10; i++) {
        arr[i] = rand() % 20 + 1;
        cout << arr[i] << " ";
    }
    int max_comparisons, min_comparisons;
    int max = max_element(arr, 10, max_comparisons);
    int min = min_element(arr, 10, min_comparisons);
    cout << endl;
    cout << "Maximum element: " << max << endl;
    cout << "Minimum element: " << min << endl;
    total_comparisons += max_comparisons + min_comparisons;
    cout << "Total comparisons: " << total_comparisons << endl;
    cout << "Average comparisons: " << total_comparisons / 10.0 << endl;
    return 0;
}