Arrays (1D & 2D Matrices) & Array Algorithms

#include <iostream.h>
#include <conio.h>

void main() {
    int a[50], n, i, largest, smallest, key, found = 0, pos = -1;

    clrscr();

    cout << "Enter number of elements (max 50): ";
    cin >> n;

    cout << "Enter " << n << " integers:" << endl;
    for (i = 0; i < n; i++) {
        cout << "Element [" << i << "]: ";
        cin >> a[i];
    }

    largest = a[0];
    smallest = a[0];

    for (i = 1; i < n; i++) {
        if (a[i] > largest)
            largest = a[i];
        if (a[i] < smallest)
            smallest = a[i];
    }

    cout << "\n--- Array Statistics ---" << endl;
    cout << "Largest Element  = " << largest << endl;
    cout << "Smallest Element = " << smallest << endl;

    cout << "\nEnter element to search: ";
    cin >> key;

    for (i = 0; i < n; i++) {
        if (a[i] == key) {
            found = 1;
            pos = i;
            break;
        }
    }

    if (found)
        cout << "Element " << key << " FOUND at index position " << pos << " (Element #" << (pos + 1) << ")." << endl;
    else
        cout << "Element " << key << " NOT FOUND in the array." << endl;

    getch();
}