summaryrefslogtreecommitdiff
path: root/c/dataStructure/线性表/顺序表/main.c
diff options
context:
space:
mode:
Diffstat (limited to 'c/dataStructure/线性表/顺序表/main.c')
-rwxr-xr-xc/dataStructure/线性表/顺序表/main.c47
1 files changed, 47 insertions, 0 deletions
diff --git a/c/dataStructure/线性表/顺序表/main.c b/c/dataStructure/线性表/顺序表/main.c
new file mode 100755
index 0000000..66e4031
--- /dev/null
+++ b/c/dataStructure/线性表/顺序表/main.c
@@ -0,0 +1,47 @@
+#include "sequence.h"
+
+int main(void)
+{
+ Elem number;
+
+ InitList(&number);
+
+ if (ListEmpty(&number))
+ printf("List now is empty\n");
+
+ printf("So the length of list would be %d\n",ListLength(&number));
+
+ for (int i = 0; i < 10; i++)
+ AddElem(&number, i*i-i*3);
+
+ ElemType n;
+ if ((n = GetElem(&number,3) != -1))
+ printf("Element at position 3 is %d\n", n);
+
+ if ((n = GetElem(&number,7)) != -1)
+ printf("Element at position 7 is %d\n", n);
+
+ if ((n = LocateElem(&number,-2)) != 0)
+ printf("Number -2 is at %dth\n",n);
+ else
+ printf("Element not found\n");
+
+ for (int i = 0; i < number.length; i++)
+ printf("Element %d: %d\n", i+1, number.elem[i]);
+ putchar('\n');
+
+ ListInsert(&number,3,7);
+
+ for (int i = 0; i < number.length; i++)
+ printf("Element %d: %d\n", i+1, number.elem[i]);
+ putchar('\n');
+
+ ListDelete(&number,6);
+
+ for (int i = 0; i < number.length; i++)
+ printf("Element %d: %d\n", i+1, number.elem[i]);
+
+ DestroyList(&number);
+
+ return 0;
+} \ No newline at end of file