Dynamic Allocation of Array Memory

//Dynamic allocation of array memory
//mjrmyke
#include <iostream>
#include <cstdlib>
#include <iomanip>
using namespace std;

void sort(int x[], int n);
int rand_int(int a, int b);
int main()
{

    int *array = NULL, n;
    cout << "Please enter an integer for the desired size of the array: " << endl;
    cin >> n; //collect array size
    array = new int[n]; //allocate n integers and save array to n
    for (int j = 0; j<n; j++) //save random numbers to array
    {
        array[j] = rand_int(1, 100);

    }
    for (int i = 0; i<n; i++) //show random numbers
    {
        cout << "Random Slot " << i + 1 << " =" << array[i] << endl;
    }

    sort(array, n); //sort array

    cout << "---------------------Sorting--------------" << endl;
    for (int p = 0; p<n; p++) //show sorted array
    {
        cout << "Ordered Slot " << p + 1 << " =" << array[p] << endl;
    }

    delete[]array; //free'd memory
    array = NULL; //clear to prevent memory references
    system("PAUSE");
    return 0;

}



void sort(int x[], int n)
{
    int k, j, m;
    int hold;
    for (k = 0; k <= n - 2; k++)
    {
        m = k;
        for (j = k + 1; j <= n - 1; j++)
        {
            if (x[j] < x[m])
                m = j;
        }

        hold = x[m];
        x[m] = x[k];
        x[k] = hold;
    }
    return;
}

int rand_int(int a, int b) //function for rolls
{
    return rand() % (b - a + 1) + a;
}