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");
}

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;
}
//返回paraListPtr中与paraValue相等元素的位置 
int locateElement(SequentialListPtr paraListPtr,int paraValue){
	for(int i=0;i<paraListPtr->actualLength;i++){
		if(paraListPtr->data[i]==paraValue){
			return i;
		}
	}
	return -1;
}
//返回第paraPosition个元素的值 
int getElement(SequentialListPtr paraListPtr, int paraPosition){
	if(paraPosition<=0){
		printf("The position is smaller than 0");
		return -1;
	}
	if(paraPosition>paraListPtr->actualLength){
		printf("The position is beyond the list long");
		return -1;
	}
	return paraListPtr->data[paraPosition-1];
}
//清空顺序表 
void clearList(SequentialListPtr paraListPtr) {
	paraListPtr->actualLength = 0;
}
void Test()
{
    int tempArray[5] = { 3, 5, 2, 7, 4 };
    SequentialListPtr tempList = sequentialListInit(tempArray, sizeof(tempArray)/4);
    printf("---- Test begins. ----\r\n");
    printf("The list is: ");
    outputList(tempList);
    int a=locateElement(tempList,3);
    if (a != -1)
    {
        printf("inuput value rank %d\n",a+1);
    }
    else
    {
        printf("the value you input dosen't exit\n");
    }
    outputList(tempList);
    int b=getElement(tempList, 1);
    if (b != -1)
    {
        printf("you get %d from that position\n",b);
    }
    outputList(tempList);
  	printf("now clear it");
    clearList(tempList);
    outputList(tempList);
    printf("The list has cleared ");
}
void main()
{
	Test();
}

运行结果：

 老师的代码：
 

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

#define LIST_MAX_LENGTH 10
/*
*Linear list of integers. The key is data.
*/
typedef struct SequentialList{
	int actualLength;
	
	int data[LIST_MAX_LENGTH];//The maximum lengtrh is fixed.
}*SequentialListPtr;

/**
*Output the list.
*/
void outputList(SequentialListPtr paraList){
	for(int i=0;i<paraList->actualLength;i++){
		printf("%d ",paraList->data[i]);
	}//of for i
	printf("\r\n");
}//of outputList

/**
*Output the memory for the list.
*/
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 acutal data:%ld\r\n",&paraListPtr->data[0]);
	printf("The address of second data:%ld\r\n",&paraListPtr->data[1]);
}//of outputMemory
/*Initialize a sequetial list. No error checking fot thie funtion.
*@param paraListPtr THe pointer to the list. It must be a pointer to change the list.
*@param paraValues An int array storing all elements.
*/
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];
	}//of for i
	resultPtr->actualLength=paraLength;
	
	return resultPtr;
}//of sequentialListInit
/*
*Insert an element into a sequential linear list.
*@param paraListPtr The pointer to the list.It must be a pointer to change the list.
*@param paraPosition The position,e.g.,0 stands for inserting at the first position.
*@param paraValues The value to be inserted.
*/
void sequentialListInsert(SequentialListPtr paraListPtr,int paraPosition,int paraValue){
	//step1.Space check.
	if(paraListPtr->actualLength>=LIST_MAX_LENGTH){
		printf("Cannot insert element:list full.\r\n");
		return;
	}//of if
	
	//step2.Position check.
	if(paraPosition<0){
		printf("Cannot insert element:negetive position unsupported.");
		return;
	}//of if
	if(paraPosition>paraListPtr->actualLength){
		printf("Cannot insert element:the position %d is bigger than the list length %d.\r\n",paraPosition,paraListPtr->actualLength);
		return;
	}//of if
	
	//step3.Move the remaining part.
	for(int i=paraListPtr->actualLength;i>paraPosition;i--){
		paraListPtr->data[i]=paraListPtr->data[i-1];
	}//of for i
	
	//step4.Insert.
	paraListPtr->data[paraPosition]=paraValue;
	
	//step5.Updata the length.
	paraListPtr->actualLength ++;
	
}//of sequentialListInsert

/*
*Test the insertfuntion.
*/
void sequentialInsertTest(){
	int i;
	int tempArray[5]={3,5,2,7,4};
	
	printf("----sequentialInsertTest begins.----\r\n");
	//Intitialize.
	SequentialListPtr tempList=sequentialListInit(tempArray,5);
	printf("After initialization,the list is:");
	outputList(tempList);
	
	//Insert to the first.
	printf("Now insert to the first,the list is:");
	sequentialListInsert(tempList,0,8);
	outputList(tempList);
	
	//Insert to the last.
	printf("Now insert to the last,the list is:");
	sequentialListInsert(tempList,6,9);
	outputList(tempList);
	
	//Insert beyond the tail.
	printf("Now insert beyond the tail.\r\n");
	sequentialListInsert(tempList,8,9);
	printf("The list is:");
	outputList(tempList);
	
	//Insert to position 3.
	for(i=0;i<5;i++){
		printf("Inserting %d.\r\n",(i+10));
		sequentialListInsert(tempList,0,(i+10));
		outputList(tempList);
	}//of for i
	
	printf("----sequentialInsertTest ends----\r\n");
}//of sequentialInsertTest

/*
*Delete an element from a sequential linear list.
*@param paraListPtr The pointer to the list. It must be a pointer to change the list.
*@param paraPosition The position,e.g.0 stands for inserting at the first position
*@return The deleted value.
*/
int sequentialListDelete(SequentialListPtr paraListPtr,int paraPosition){
	//step1.Position check.
	if(paraPosition<0){
		printf("Invalid position:%d.\r\n",paraPosition);
		return -1;
	}//of if
	
	if(paraPosition>=paraListPtr->actualLength){
		printf("cannot delete element:the position %d is beyond the list length %d.\r\n",paraPosition,paraListPtr->actualLength);
		return -1;
	}//of if
	
	//step2.Move the remaining part.
	int resultValue=paraListPtr->data[paraPosition];
	for(int i=paraPosition;i<paraListPtr->actualLength;i--){
		paraListPtr->data[i]=paraListPtr->data[i+1];
	}//of for i
	
	//step3.Update the length.
	paraListPtr->actualLength --;
	
	//step4.return the value.
	return resultValue;
}//of sequentialListDelete

/*
*Test the delete function.
*/
void sequentialDeleteTest(){
	int tempArray[5]={3,5,2,7,4};
	
	printf("----sequentialDeleteTest begins.----\r\n");
	
	//Initialize.
	SequentialListPtr tempList = sequentialListInit(tempArray,5);
	printf("After initialization,the list is:");
	outputList(tempList);
	
	//Delete the first.
	printf("Now delete the first,the list is:");
		sequentialListDelete(tempList, 0);
	outputList(tempList);

	// Delete to the last.
    printf("Now delete the last, the list is: ");
	sequentialListDelete(tempList, 3);
	outputList(tempList);

	// Delete the second.
    printf("Now delete the second, the list is: ");
	sequentialListDelete(tempList, 1);
	outputList(tempList);

	// Delete the second.
    printf("Now delete the 5th, the list is: ");
	sequentialListDelete(tempList, 5);
	outputList(tempList);

	// Delete the second.
    printf("Now delete the (-6)th, the list is: ");
	sequentialListDelete(tempList, -6);
	outputList(tempList);

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

	outputMemory(tempList);
}//of sequentialDeleteTest

/*
 * Locate an element in the list.
 * @param paraListPtr The pointer to the list.
 * @param paraValue the indicated value.
 * @return The position of the value, or  -1 indicating not exists
 */
int locateElement(SequentialListPtr paraListPtr,int paraValue){
	for(int i=0;i<paraListPtr->actualLength;i++){
		if(paraListPtr->data[i]==paraValue){
			return i;
		}
	}
	return -1;
}
/**
 * Get an element in the list.
 * @param paraListPtr The pointer to the list.
 * @param paraPosition The given position.
 * @return The position of the value, or  -1 indicating not exists
 */
int getElement(SequentialListPtr paraListPtr, int paraPosition) {
    // Step 1. Position check.          
    if (paraPosition < 0) {
        printf("Invalid position: %d.\r\n", paraPosition);
        return -1;
    }//Of if

    if (paraPosition >= paraListPtr->actualLength) {
        printf("Cannot delete element: the position %d is beyond the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
        return -1;
    }//Of if

	return paraListPtr->data[paraPosition];
}// Of locateElement

/**
 * Clear elements in the list.
 * @param paraListPtr The pointer to the list.
 * @return The position of the value, or  -1 indicating not exists
 */
void clearList(SequentialListPtr paraListPtr) {
	paraListPtr->actualLength = 0;
}// Of clearList

/**
 The entrance.
 */

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