MyArray.h

#ifndef MYARRAY_H_INCLUDED
#define MYARRAY_H_INCLUDED

#include <iostream>
#include <stdlib.h> //Random
#include <time.h> //Use as a random seed
#include "Algorithms.h"

class MyArray
{
    private:
        int arr_size = 0;
        int *arr;
        char order;
        char algorithm;

        void generate_array()
        {
            /*
                1. Crescent
                2. Decrescent
                3. Random
            */
            arr = new int[arr_size];
            switch (order)
            {
                case '1':
                    for (int i = 0; i < arr_size; i++)
                        arr[i] = i;
                    break;
                case '2':
                    for (int i = arr_size - 1; i >= 0; i--)
                        arr[i] = arr_size - 1 - i;
                    break;
                case '3':
                    srand (time(NULL));
                    for (int i = 0; i < arr_size; i++)
                        arr[i] = rand() % arr_size;
                    break;
            }
        }

    public:
        MyArray(int a_size, char ord, char alg)
        {
            arr_size = a_size;
            order = ord;
            algorithm = alg;

            generate_array();
        }

        ~MyArray()
        {
            delete arr;
        }

        void sort_array()
        {
            /*
                1. Bubble Sort
                2. Insertion Sort
                3. Selection Sort
            */
            switch(algorithm)
            {
                case '1':
                    bubble_sort(arr,arr_size);
                    break;
                case '2':
                    insertion_sort(arr,arr_size);
                    break;
                case '3':
                    selection_sort(arr,arr_size);
                    break;
                case '4':
                    quick_sort(arr,0,arr_size-1);
                    break;
                case '5':
                    merge_sort(arr,0,arr_size-1);
                    break;
                case '6':
                    heap_sort(arr,arr_size);
                    break;
                case '7' :
                    radixsort(arr , arr_size);
                    break;
                case '8':
                  pigeonholeSort(arr, arr_size);
            }
        }

};

#endif // MYARRAY_H_INCLUDED