Sorting an array of unique random numbers at insertion

I found a piece of code that works well to fill an array with a unique random numbers.开发者_开发技巧 My problem now is, that I want to sort these numbers, but not after the array is full but as new numbers are being inserted. So as each new number is inserted into the array, if finds the position it is meant to be in. The code I have for creating unique random numbers is below, thank you in advance:

    #include <iostream>
    #include <stdio.h>
    #include <stdlib.h>
    #include <time.h>
    using namespace std;
    #define MAX 2000        // Values will be in the range (1 .. MAX) 
    static int seen[MAX];   // These are automatically initialised to zero
                            // by the compiler because they are static.
    static int randomNum[1000];

    int main (void) {
    int i;

    srand(time(NULL));   // Seed the random number generator. 

    for (i=0; i<1000; i++) 
    {
      int r;
      do 
  {
        r = rand() / (RAND_MAX / MAX + 1);
      } 
    while (seen[r]);
        seen[r] = 1;
        randomNum[i] = r + 1;
      }

      for (i=0; i<1000; i++)
        cout << randomNum[i] << endl;

  return 0;
} 

---

You're looking for insertion sort.

Once you got that working, you should switch to binary insertion sort. Binary insertion sort is much faster if the array is big.