2.1顺序表

顺序表代码如下：

#include<stdio.h>
#include<malloc.h>
 
#define LIST_MAX_LENGTH 10
/*
/**
 * Linear list of integers.The key is data. linear 线性的 integer 整数 
 */
 typedef struct SequentialList {//sequential 连续的 
 	int actualLength;
	
	int data[LIST_MAX_LENGTH];//The maximum length is fixed. 最大长度是固定的 
 } *SequentialListPtr;  
 
/**
 * Output the list 
 */
 void outputList(SequentialListPtr paraList) {
 	int i;
	for( 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 structur: %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 secong 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 参数 
 * @param paraValues An int array storing all elements.element 要素 
 */
 SequentialListPtr sequentialListInit(int paraData[], int paralength) {
 	SequentialListPtr resultPtr = (SequentialListPtr)malloc(sizeof(struct SequentialList));
 	int i;
 	for( 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 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 elements: List full.\r\n");
		return; 
	 }//Of if
	 
	//Step 2. Position check.
	if(paraPosition < 0) {
		printf("Cannot insert element: 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.
	int i;
	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 i;
 	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 the last. the list is: ");
 	sequentialListInsert(tempList, 6, 9);
 	outputList(tempList);
 	
 	//Insert beyond tne 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) {
 	//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];
	int i;
	for ( i = paraPosition; i < paraListPtr->actualLength; i ++) {
		paraListPtr->data[i] = paraListPtr->data[i + 1];		
	}//Of for i
	
	//Step 3. Update thee 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, 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("---- sequentialDelteTset 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) {
 	int i;
 	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 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 lacateElement
 
 /**
 * 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 
  */

运行结果

写代码时，要做到书写规范，有意识的增加备注，让自己的代码更加易于理解。也便于自己日后复习查看，代码有一定的格式，在什么位置敲空格都有讲究。写代码时，先列出总纲，再在每一个函数里面添加内容优化，能让自己的思路清晰明了。