课后习题 2-11 查找顺序表最大最小值

Array.h

#pragma once
#include<iostream>
using namespace std;

class Array {
    int* data;
    int maxSize;
    int len;
public:
    Array(int n = 30) {
        maxSize = n;
        data = new int[maxSize];
        len = 0;
    }
    void creat(int arr[], int n) {
        for (int i = 0; i < n; i++) {
            data[i] = arr[i];
            len++;
        }
    }
    void show() {
        for (int i = 0; i < len; i++) {
            cout << data[i] << " ";
        }
        cout << endl;
    }
    void search(int& max, int& min) {
        int t_max = data[0];
        int t_min = data[0];
        for (int i = 1; i < len; i++) {
            if (data[i] > t_max) {
                t_max = data[i];
            }
            else if (data[i] < t_min) {
                t_min = data[i];
            }
        }
        max = t_max;
        min = t_min;
    }
};

main.cpp

#include"Array.h"

int main() {
    Array L;
    int arr[] = { 56,-45,30,45,-47,12,51,-1,0,-27,-24,51 };
    L.creat(arr, 12);
    L.show();
    int min = 0;
    int max = 0;
    L.search(max, min);
    cout << max << "  " << min << endl;
    return 0;
}