C语言 顺序表的插入，删除和查找

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

#define LIST_MAX_LENGTH 10

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

/**
*Output the list.
*/

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

/**
 * Output the memory for the list.  //这里老师的memory(内存)打错了 
 */
void outputMemory(SequentialListPtr paraListPtr){
	printf("The address of the structure: %ld\r\n",paraListPtr);
	printf("The address of the actualLength:%ld\r\n",&paraListPtr->data);
	printf("The address of the data: %ld\r\n",&paraListPtr->data);
	printf("The address of the actual data: %ld\r\n",&paraListPtr->data[0]);
	printf("The address of the second data: %ld\r\n",&paraListPtr->data[1]);
}//Of outputMemory

/**
 *Initialize a sequential list.No error checking for this function.
 *@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 (i=0;i<paraLength;i++){
		resultPtr->data[i] = paraData[i];
	}//Of for i
	resultPtr->actualLength = paraLength;
}//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 paraValue The value to be inserted.
 */
 
void sequentialListInsert(SequentialListPtr paraListPtr,int paraPosition,int paraValue){
	//Step 1.Space check.
	if(paraListPtr->actualLength>=LIST_MAX_LENGTH){
		printf("Cannot insert element:list full.\r\n");
		return; //void应该没有返回值，应该不用return也行 
	}//Of if
	//Step 2. Position check.
	if(paraPosition < 0){
		printf("negative 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
	
	//Step 3.Move the remaining part.
	for (i = paraListPtr->actualLength;i>paraPosition;i--){
		paraListPtr->data[i]=paraListPtr->data[i-1];
	}//Of for i
	
	//Step 4.insert.
	paraListPtr->data[paraPosition]=paraValue;
	
	//Step 5.Update the length.
	paraListPtr->actualLength++;
}//Of sequentialListInsert


/**
 *Test the insert function.
 */
void sequentialInsertTest(){
	int tempArray[5] = {3,5,2,7,4};
	
	printf("---- sequentialInsertTest begins. ----\r\n");
	
	//Initialize.
	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); //原长度为5，插入一个后为6，但末序号为5，插入位置6的话，感觉会出错  
	outputList(tempList); 				//运行后没出错 ，因为插入函数中的判断语句是大于长度，6此时没大于长度 
	
	//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); //预计会把表中的第一个数字依次变为10,11,12,13,14   //运行后发现，插入12后顺序表已达到最大长度10 
	}//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){
 	//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
	  
	//Step 2.Move the remaining part.
	int resultValue = paraListPtr->data[paraPosition];
	for (i=paraPosition;i<paraListPtr->actualLength;i++){
		paraListPtr->data[i] = paraListPtr->data[i+1];
	}//Of for i
	
	//Step 3.Update the length.
	paraListPtr->actualLength--;
	
	//Step 4.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 to 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,5);
	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 (i=0;i<paraListPtr->actualLength;i++){
		if(paraListPtr->data[i] == paraValue){
			return i;
		}// Of if
	}//Of for i
	
	return -1;
}//Of locateElement

/**
 * Get an element in the list.
 * @param paraListPtr The pointer to the list.
 * @param paraPosition The position of 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 get 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 paramListPtr The pointer to the list.
 *@return The position of the value,or -1 indicating not exists
 */
void clerList(SequentialListPtr paraListPtr){
	paraListPtr->actualLength = 0;
}//Of clearList

/**
 The entrance.
 */
void main(){
	sequentialInsertTest();
	sequentialDeleteTest();
}//Of main
 

运行结果如下：