117.类模板封装数组类

#include <iostream>
#include <initializer_list>
#include <memory>
using namespace std;

template <class T,int n>
class myarray
{
private:
    T * p;
public:
    myarray(initializer_list<T> mylist)
    {
        //开辟内存
        p = new T[n];
        //内存清零
        memset(p, 0, sizeof(T)*n);
        int length = mylist.size();
        if (length > n)
        {
            abort();
        }
        else
        {
            int i = 0;
            //数据填充
            for (auto j : mylist)
            {
                p[i] = j;
                i++;
            }
        }
    }
    void show()
    {
        for (int i = 0; i < n; i++)
        {
            cout << p[i] << endl;
        }
    }

    //模板排序
    void sort()
    {
        for (int i = 0; i < n - 1; i++)
        {
            for (int j = 0; j < n - 1 - i; j++)
            {
                if (p[j] < p[j + 1])
                {
                    T temp = p[j]; 
                    p[j] = p[j + 1];
                    p[j + 1] = temp;
                }
            }
        }
    }

    myarray()
    {
        delete[]p;
    }
};

void main()
{
    myarray<int, 10> my1 = { 1,2,3,4,5,6,7,8,9 };
    my1.sort();
    my1.show();
    cin.get();
}