#include <iostream>
#include <time.h>
#include <stdlib.h>

using namespace std;

// Pointer to A matrix. Matrix still does not exist.
unsigned int * A;

// N length of A matrix. 0 to 65535.
unsigned short N = 0;

void initMatrix()
{
    // Initialize A matrix with random integers in the range <1, 200.000>
    for(unsigned short i=0; i<N; i++)
    {
        A[i] = rand() % 200000 + 1;
        //cout << A[i] << endl;
    }
}

void Insertion()
{
    unsigned short i,k,j;
    unsigned int min;
    for (i=0; i<N; i++)
    {
        k = i;
        min = A[i];
        for (j = i+1; j<N; j++)
        {
            if (A[j] < min)
            {
                k = j;
                min = A[j];
            }
        }
        A[k] = A[i];
        A[i] = min;
        cout << A[i] << endl;
     }
}

int main()
{
    // Initialize random seed
    srand ( time(NULL) );

    short menuItem = 0;
    cout << "======================" << endl;
    cout << "         MENU         " << endl;
    cout << "======================" << endl;
    cout << "1. Selection Sort     " << endl;
    cout << "2. Insertion Sort     " << endl;
    cout << "3. Exit               " << endl;
    cout << "4. Bubble Sort        " << endl;
    cout << "5. Heap Sort          " << endl;
    cout << "6. Merge Sort         " << endl;
    cout << "7. Quicksort          " << endl;

    while(menuItem < 1 || menuItem > 7)
    {
        cout << "\nPlease enter your choice(1 to 7): ";
        cin >> menuItem;
    }

    if(menuItem==3)
    {
        cout << "Bye bye!" << endl;
        return 0;
    }

    // For performance reasons do not allow the user to enter a big length.
    while(N<=0 || N>255)
    {
        cout << "Now please enter the length of A matrix(1 to 255): ";
        cin >> N;
    }

    // Allocate N unsigned integers
    A = new unsigned int[N];

    switch (menuItem)
    {
     case 1:
        cout << "Selection Sort" << endl;
        for(short i=0; i<10; i++)
        {
            initMatrix();

        }
        break;
     case 2:
        cout << "Insertion Sort" << endl;
        for(short i=0; i<10; i++)
        {
            initMatrix();
            Insertion();
            cout << "" << endl;
        }
        break;
     case 4:
        cout << "Bubble Sort" << endl;
        break;
     case 5:
        cout << "Heap Sort" << endl;
        break;
     case 6:
        cout << "Merge Sort" << endl;
        break;
     case 7:
        cout << "Quick Sort" << endl;
        break;
    }

    return 0;
}