数据结构作业1（顺序表）

一.代码如下

#include <stdio.h>
#include <malloc.h>

#define LIST_MAX_LENGTH 10


typedef struct SequentialList 
{
    int actualLength;
    int data[LIST_MAX_LENGTH];
} *SequentialListPtr;

void OutPutList(SequentialListPtr paraList)
{
    for (int i = 0; i < paraList->actualLength; i++) {
        printf("%d ", paraList->data[i]);
    }
    printf("\r\n");
}


void OutPutMemory(SequentialListPtr paraListPtr)
{
    printf("The address of the structure: %ld\r\n", paraListPtr);
    printf("The address of actualLength: %ld\r\n", &paraListPtr->actualLength);
    printf("The address of data: %ld\r\n", &paraListPtr->data);
    printf("The address of actual data: %ld\r\n", &paraListPtr->data[0]);
    printf("The address of second data: %ld\r\n", &paraListPtr->data[1]);
}


SequentialListPtr sequentialListInit(int paraData[], int paraLength)
{
    SequentialListPtr resultPtr = (SequentialListPtr)malloc(sizeof(struct SequentialList));
    for (int i = 0; i < paraLength; i++) {
        resultPtr->data[i] = paraData[i];
    }
    resultPtr->actualLength = paraLength;

    return resultPtr;
}


void sequentialListInsert(SequentialListPtr paraListPtr, int paraPosition, int paraValue)
{
    if (paraListPtr->actualLength >= LIST_MAX_LENGTH) {
        printf("Cannot insert element: list full.\r\n");
        return;
    }

    if (paraPosition < 0) {
        printf("Cannot insert element: negative position unsupported.");
        return;
    }

    if (paraPosition > paraListPtr->actualLength) {
        printf("Cannot insert element: the position %d is bigger than the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
        return;
    }

    for (int i = paraListPtr->actualLength; i > paraPosition; i--) {
        paraListPtr->data[i] = paraListPtr->data[i - 1];
    }

    paraListPtr->data[paraPosition] = paraValue;

    paraListPtr->actualLength++;
}

void sequentialInsertTest()
{
    int i;
    int tempArray[5] = { 3,5,2,7,4 };

    printf("---- sequentialInsertTest begins. ----\r\n");

    SequentialListPtr tempList = sequentialListInit(tempArray, 5);
    printf("After initialization,the list is: ");
    OutPutList(tempList);

    printf("Now insert to the first,the list is: ");
    sequentialListInsert(tempList, 0, 8);
    OutPutList(tempList);

    printf("Now insert to the last,the list is: ");
    sequentialListInsert(tempList, 6, 9);
    printf("The list is: ");
    OutPutList(tempList);

    printf("Now insert beyond the tail. \r\n");
    sequentialListInsert(tempList, 8, 9);
    printf("The list is: ");
    OutPutList(tempList);

    for (int i = 0; i < 5; i++) {
        printf("Inserting %d.\r\n", (i + 10));
        sequentialListInsert(tempList, 0, (i + 10));
        OutPutList(tempList);
    }

    printf("----- sequentialInsertTest ends. ----\r\n");

}


int sequentialListDelete(SequentialListPtr paraListPtr, int position)
{
    
    if (position < 0) {
        printf("Invalid position: %d.\r\n", position);
        return -1;
    }

    if (position >= paraListPtr->actualLength) {
        printf("Can't delete element: teh position %d is beyond the list length %d.\r\n", position, paraListPtr->actualLength);
        return -1;
    }
    int resultValue = paraListPtr->data[position];
    for (int i = position; i < paraListPtr->actualLength; i++) {
        paraListPtr->data[i] = paraListPtr->data[i + 1];
    }

    paraListPtr->actualLength--;

    return resultValue;
}

void sequentialDeleteTest()
{
    int tempArray[5] = { 3,5,2,7,4 };

    printf("\n----- sequentialDeletTest begins. ---\r\n");

    SequentialListPtr tempList = sequentialListInit(tempArray, 5);
    printf("After initialization,the list is: ");
    OutPutList(tempList);

    printf("Now delete the first, the list is: ");
    sequentialListDelete(tempList, 0);
    OutPutList(tempList);

    printf("Now delete the last, the list is: ");
    sequentialListDelete(tempList, 3);
    OutPutList(tempList);

    printf("Now delete the second, the list is: ");
    sequentialListDelete(tempList, 1);
    OutPutList(tempList);

    printf("Now delete the 5th, the list is: ");
    sequentialListDelete(tempList, 5);
    OutPutList(tempList);

    printf("Now delete the (-6)th, the list is: ");
    sequentialListDelete(tempList, -6);
    OutPutList(tempList);

    printf("---- sequentialDeleteTest ends. ----\r\n");

    OutPutMemory(tempList);

}


int locateElement(SequentialListPtr paraListPtr, int paraValue)
{
    for (int i = 0; i < paraListPtr->actualLength; i++) {
        if (paraListPtr->data[i] == paraValue) {
            return i;
        }
    }
    return -1;
}


int getElement(SequentialListPtr paraListPtr, int position)
{
    
    if (position < 0) {
        printf("Invalid position: %d.\r\n", position);
        return -1;
    }

    if (position >= paraListPtr->actualLength) {
        printf("Can't get element:the position %d is beyond the list length %d.\r\n", position, paraListPtr->actualLength);
        return -1;
    }

    return paraListPtr->data[position];
}

void changeElement(SequentialListPtr paraListPtr, int position, int value)
{
    
    if (position < 0) {
        printf("Invalid position: %d.\r\n", position);
        return;
    }

    if (position >= paraListPtr->actualLength) {
        printf("Can't change element:the position %d is beyond the list length %d.\r\n", position, paraListPtr->actualLength);
        return;
    }

    for (int i = 0; i < paraListPtr->actualLength; i++) {
        if (i == position) {
            paraListPtr->data[i] = value;
            return;
        }
    }

}


void clearList(SequentialListPtr paraListPtr)
{
    paraListPtr->actualLength = 0;
}

void main()
{
    sequentialInsertTest();
    sequentialDeleteTest();
}

二.运行结果

三.体会

1. 顺序表，在创建的时候确定最多可存储数据元素个数，如果数据元素过多，资源不足；如果数据元素太少，会造成资源的浪费；一般用于确定数据元素条数的情况下使用；
2. 顺序在实现数据元素的插入和删除的时候，效率低；而顺序表在实现数据元素的查询和修改的时候，效率高。