summaryrefslogtreecommitdiff
path: root/c/dataStructure/线性表/顺序表/main.c
blob: 66e4031078ccea71fccf7193def5c927df52e8c8 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
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;
}