diff --git a/_01.线性表顺序存储.c b/_01.线性表顺序存储.c
index b30be40..4f56457 100644
--- a/_01.线性表顺序存储.c
+++ b/_01.线性表顺序存储.c
@@ -2,7 +2,7 @@
  * @Author: Xu Bai
  * @Date: 2019-06-25 23:10:17
  * @LastEditors: Xu Bai
- * @LastEditTime: 2019-06-26 15:06:35
+ * @LastEditTime: 2019-06-26 15:43:37
  */
 
 #include "stdio.h"
@@ -26,21 +26,19 @@ Status visit(ElemType c)
     return OK;
 }
 
-
-
 typedef struct
 {
     ElemType data[MAXSIZE];
     int length;
 } SqList;
 
-Status ListTraverse(SqList L){
+Status ListTraverse(SqList L)
+{
     int i = 0;
-    for ( i = 0; i <= L.length -1; i++)
+    for (i = 0; i <= L.length - 1; i++)
     {
-       visit(L.data[i]);
+        visit(L.data[i]);
     }
-    
 }
 
 Status InitList(SqList *L)
@@ -78,7 +76,7 @@ Status GetElem(SqList L, ElemType *e, int i)
     {
         return ERROR;
     }
-    *e = L.data[i - 1]; // 返回第i个元素，下标为i -1
+    *e = L.data[i - 1]; // ���ص�i��Ԫ�أ��±�Ϊi -1
     return OK;
 }
 
@@ -89,7 +87,7 @@ int LocateElem(SqList L, ElemType e)
         return ERROR;
     }
     int i;
-    for (i = 0; i < L.length; i++) // 长度为5，下标为0~4
+    for (i = 0; i < L.length; i++) // ����Ϊ5���±�Ϊ0~4
     {
         if (L.data[i] == e)
         {
@@ -101,42 +99,39 @@ int LocateElem(SqList L, ElemType e)
 
 Status ListInert(SqList *L, ElemType e, int i)
 {
-    // 在第i个位置之前插入新元素e
-    // 初始条件：L存在且不满,且i<=length
+    // �ڵ�i��λ��֮ǰ������Ԫ��e
+    // ��ʼ������L�����Ҳ���,��i<=length
     if (L->length == MAXSIZE || i < 1 || i > L->length + 1)
     {
-        
+
         return ERROR;
     }
     int k;
-    // 插入新元素
-    for (k = L->length - 1; k >= i -1; k--)
+    // ������Ԫ��
+    for (k = L->length - 1; k >= i - 1; k--)
     {
-        L ->data[k + 1] = L ->data[k];
-        // 从最后一个位置(length下标)开始移动
+        L->data[k + 1] = L->data[k];
+        // �����һ��λ��(length�±�)��ʼ�ƶ�
     }
-    L ->data[i-1] = e;
-    L ->length ++;
+    L->data[i - 1] = e;
+    L->length++;
 }
 
-
-
-int main(){
+int main()
+{
     SqList L;
     int isInit = InitList(&L);
-    if (isInit)
+    int n;
+    int elem;
+    printf("��ʼ��");
+    for (int k = 1; k < 6; k++)
     {
-        for (int j = 0; j <= 5 ; j++)
-        {
-            int res = ListInert(&L,j,1);
-            
-        }
-        
+        ListInert(&L, k, 1);
     }
+
     ListTraverse(L);
     //ceshi12233
     getchar();
+}
 
-
-    
-}
\ No newline at end of file
+// EOFΪctrl + z
\ No newline at end of file
diff --git a/a.out b/a.out
index 5c3c841..0450508 100644
Binary files a/a.out and b/a.out differ