数据结构-顺序表

#include<stdio.h>
#include<malloc.h>
#define LIST_MAX_LEGENTH 10
/**
 * Linear list of integers.The key is data.
 **/
 typedef struct SequentialList{
     int actualLength;
     int data[LIST_MAX_LEGENTH];
 }*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 actuallLength:%ld\r\n",¶ListPtr->actualLength);
    printf("The address of data:%ld\r\n",¶ListPtr->data);
    printf("The address of actual data:%ld\r\n",¶ListPtr->data[0]);
    printf("The address of second data:%ld\r\n",¶ListPtr->data[1]);
}//Of outputMemory.
/**
 * Initialize asequential list.No error checking for this function .
 *  @program paraListPtr The pointer to the list.It must be a pointer to change the list.
 * @program 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 sequentia