顺序表的插入和删除用算法流程图怎么表示

代码如下:
Status ListInsert_Sq(SqList& L, int i, book e) {//在第i个位置插入
if ((i < 1) || (i > L.length + 1))
return ERROR;
if (L.length == MAXSIZE)
return ERROR;
for (int j = L.length - 1; j >= i - 1; j--)
L.elem[j + 1] = L.elem[j];//后移
L.elem[i - 1] = e;
++L.length;
return OK;

Status ListDelete_Sq(SqList& L, int i) {//删除
if ((i < 1) || (i > L.length + 1))
return ERROR;
for (int j = i; j <= L.length; j++)
L.elem[j - 1] = L.elem[j];//被删元素之后的前移
--L.length;
return OK;