c++顺序表为啥会这样

试过网上那个更改属性的，没有用

#include<iostream>
using namespace std;
const int MaxSize = 100;
template<typename DataType>
class SeqList
{
public:
    SeqList();
    SeqList(DataType a[], int n);
    ~SeqList();
    int Locate(DataType x);
    void Insert(int i, DataType x);
    DataType Delete(int i);
    void PrintList();
private:
    int length;
    DataType data[MaxSize];
};
template<typename DataType>
SeqList<DataType>::SeqList(DataType a[], int n)
{
    for (int i = 0; i < length; i++)
        data[i] = a[i];
    length = n;
}
template<typename DataType>
void SeqList<DataType>::PrintList()
{
    for (int i = 0; i < length; i++)
        cout << data[i] << " ";
    cout << endl;
}
template<typename DataType>
void SeqList<DataType>::Insert(int i, DataType x)
{
    for (int j = length; j > i; j++)
    {
        data[j] = data[j - 1];
    }
    data[i - 1] = x;
    length++;
    for (int i = 0; i < length; i++)
        cout << data[i] << " ";
    cout << endl;
}
template<typename DataType>
int SeqList<DataType>::Locate(DataType x)
{
    for (int i = 0; i < length; i++)
    {
        if (data[i] == x)
            cout << "数据在第" << i << "位";
        else
        {
            cout << "查找失败";
        }
    }
    return 0;
}
template<typename DataType>
DataType SeqList<DataType>::Delete(int i)
{
    for (int j = i; j < length; j++)
    {
        data[j-1] = data[j];
    }
    length--;
    for (int i = 0; i < length; i++)
        cout << data[i] << " ";
    cout << endl;
    return 0;//补充
}
int main()
{
    int A[10], i = 0,x = 0;
    srand((unsigned)time(NULL));
    for(i=0;i<10;i++)
    {
        A[i] = rand();
    }
    SeqList<int>L{ A,10 };
    cout << "当前线性表的数据为：";
    L.PrintList();
    cout << "输入查找的数";
    cin >> i;
    L.Locate(i);
    cout << "输入插入的数和插入位置";
    cin >> x >> i;
    L.Insert(i, x);
    cout << "输入删除的位置";
    cin >> i;
    L.Delete(i);
}