C++ / 顺序表的逆置

#include <iostream>
#define MAXSIZE 100

using namespace std;
typedef int ElemType;
typedef struct
{
    ElemType data[MAXSIZE];     //顺序表的元素
    int length;                 //顺序表的当前当前长度
}SqList;

void Create(SqList& L, ElemType n)
//创建长度为n的顺序表
{
    L.length = 0;
    for(int i = 0; i < n; i++)
    {
        cin >> L.data[i];
        L.length++;
    }
}
void ReverseSqlist(SqList& L)
//顺序表的逆置
{
    ElemType temp;      //辅助变量
    for(int i = 0; i<L.length/2; i++)
    {
        temp = L.data[i];
        L.data[i] = L.data[L.length-i-1];
        L.data[L.length-i-1] = temp;
    }
}
void Print(SqList L,ElemType n)
//打印顺序表
{
    for(int i = 0;i < n; i++)
    {
        cout << L.data[i] <<" ";
    }
}

int main() {
    SqList L;
    int n;
    cin >> n;
    Create(L,n);
    ReverseSqlist(L);
    Print(L,n);
    return 0;
}