#include "stdafx.h"
#include <iostream>
#include <cstdio>
#include <chrono>
using namespace std;
typedef chrono::high_resolution_clock CLOCK;

int n = 0;
int m = 0;
int x = 1;
int MIN;        //minimalna wartosc tablicy
int MAX;        //maksymalna wartosc tablicy
int SIZE;       //rozmiar tablicy
int VMIN;       //najmniejsza szukana liczba
int VMAX;       //najwieksza szukana liczba
int main()
{
    srand(time(NULL));
    cout << "Podaj rozmiar tablicy: " << endl;
    cin >> SIZE;
        do
        {
            cout << "Podaj minimalna wartosc: ";
            cin >> MIN;
            cout << "Podaj maksymalna wartosc: ";
            cin >> MAX;
            MAX++;
            if (MIN <= MAX)
                x = 0;
            else
            {
                cout << "Maksymalna wartosc nie moze byc wieksza od minimalnej.";
                cout << endl;
            }
        } while (x == 1);
        cout << endl;
    int * tablica = new int[SIZE];

    do
    {
        tablica[n] = (rand() % (MAX-MIN)+MIN);
        n++;

    } while (n < SIZE);
    do
    {
        cout << tablica[m] << " ";
        m++;
    } while (m < SIZE);
    cout << endl << endl;
    cout << "Narysowano zadana tablice.\n";
    VMIN = tablica[0];
    VMAX = tablica[0];
    auto TIME0 = CLOCK::now();                      //start
    for (int i = 1; i < SIZE; i++)                  //szukanie minimum
    {
        if (tablica[i] < VMIN)
            VMIN = tablica[i];
    }
    for (int u = 1; u < SIZE; u++)                  //szukanie maksimum
    {
        if (tablica[u] > VMAX)
            VMAX = tablica[u];
    }
    auto TIME1 = CLOCK::now();                       //stop
    delete[] tablica;
    cout << "Najmnijesza liczba to: " << VMIN << endl;
    cout << "Najwieksza liczba to: " << VMAX << endl;
    cout << "Czas szukania tych wartosci:" << chrono::duration_cast<chrono::nanoseconds>(TIME1-TIME0).count() <<"ns"<< endl;
    return 0;
}