資料結構：線性表的順序實現2.2

gaopengtttt發表於2016-09-13
資料結構
對於一個線性表如果我們使用順序的實現，那麼在insert或者delete一個值的時候最壞漸進時間複雜度
趨近於資料的規模n及
f(n)=O(n);
可以看到這個時候代價比較高，所以我們一般使用鏈試實現，關於這個演算法我用C語言進行如下實現。
當使用鏈試實現的時候代替 時間複雜度為O(1) 出於演示並沒有寫free 釋放記憶體
但是我們也可以想到關於固定位置的元素查詢順序實現其時間複雜度為O(1)，而連結串列結構則為O(n)

點選(此處)摺疊或開啟

  1. /*************************************************************************
  2.     > File Name: sqlist.c
  3.     > Author: gaopeng
  4.     > Mail: gaopp_200217@163.com
  5.     > Created Time: Tue 04 Oct 2016 09:12:11 PM CST
  6.  ************************************************************************/

  8. #include<stdio.h>
  9. #include<stdlib.h>
  10. #include<string.h>
  11. #define INITSIZE 10

  13. typedef unsigned int uint;
  14. typedef int Etype;

  16. typedef struct sqlist
  17. {
  18.         Etype* elem; //pointer of sqlist base address
  19.         uint length; //current length of elem
  20.         uint m_size; //
  21. } SQLIST;



  25. void initsqlist(SQLIST* inlist)
  26. {
  27.         inlist->elem = (Etype* )malloc(sizeof(Etype)*(INITSIZE+2) + 1);
  28.         inlist->length = 0;
  29.         inlist->m_size = INITSIZE; //maxsize
  30. }


  33. void initsqlinsert(SQLIST* inlist,Etype ielem,uint postion) //insert elem before postion
  34. {
  35.         int i;
  36.         Etype* newbase;
  37.         if(postion > inlist->length + 1 || postion < 1)
  38.         {
  39.                 printf("line table must continuous or postion must>0!\n");
  40.                 exit(1);
  41.         }

  43.         if(inlist->length + 1 >= inlist->m_size ) //if memory small will give more memory
  44.         {
  45.                 if(!(newbase =(Etype* )realloc(inlist->elem,(inlist->length+INITSIZE+2)* sizeof(Etype)+1)))
  46.                 {
  47.                         printf("mem alloc failed!\n");
  48.                         exit(2);
  49.                 }
  50.                 inlist->elem = newbase;
  51.                 inlist->m_size = inlist->m_size+INITSIZE;
  52.         }

  54.         for(i=0;i<(inlist->length-postion+2);i++) //every elem +1
  55.         {
  56.                 *(inlist->elem+inlist->length+1-i) = * (inlist->elem+inlist->length-i);
  57.         }
  58.         *(inlist->elem+inlist->length+1-i) = ielem; //give value
  59.         inlist->length =inlist->length+1;
  60. }

  62. void delsqldel(SQLIST* inlist,uint postion) //delete elem of postion every elem -1
  63.         int i;
  64.         if((postion > inlist->length) ||(postion <1))
  65.         {
  66.                 printf("give postion is must large than 1 and less than current length\n");
  67.         }

  69.         for(i=0;i<(inlist->length-postion) ;i++)
  70.         {
  71.                 *(inlist->elem+postion+i) = *(inlist->elem+postion+i+1);
  72.         }
  73.         inlist->length =inlist->length-1;
  74. }

  76. void view(SQLIST* inlist)
  77. {
  78.         int i;
  79.         if(inlist->length ==0 )
  80.         {
  81.                 printf("init data arrary! no data found!\n");
  82.                 exit(3);
  83.         }
  84.         for(i=0;i<inlist->length;i++)
  85.         {
  86.                 printf("node:%d values is:%d data length:%d max_size:%d \n",i,*(inlist->elem+i),inlist->length,inlist->m_size);
  87.         }
  88. }


  91. int main(void)
  92. {
  93.     SQLIST a;
  94.         initsqlist(&a);
  95.         printf("insert two values\n");
  96.         initsqlinsert(&a,5,1);
  97.         initsqlinsert(&a,10,1);
  98.         view(&a);

  100.         printf("delete one values\n");
  101.         delsqldel(&a,2);

  103.         view(&a);

  105.         printf("insert more than 10 values\n");
  106.         initsqlinsert(&a,10,1);
  107.         initsqlinsert(&a,20,1);
  108.         initsqlinsert(&a,30,1);
  109.         initsqlinsert(&a,40,1);
  110.         initsqlinsert(&a,50,1);
  111.         initsqlinsert(&a,10,1);
  112.         initsqlinsert(&a,10,1);
  113.         initsqlinsert(&a,10,1);
  114.         initsqlinsert(&a,10,1);
  115.         initsqlinsert(&a,10,1);
  116.         initsqlinsert(&a,10,1);
  117.         view(&a);


  120.         return 0;
  121. }

執行如下：
gaopeng@bogon:~/datas/part2$ ./a.out 
insert two values
node:0 values is:10 data length:2 max_size:10 
node:1 values is:5 data length:2 max_size:10 
delete one values
node:0 values is:10 data length:1 max_size:10 
insert more than 10 values
node:0 values is:10 data length:12 max_size:20 
node:1 values is:10 data length:12 max_size:20 
node:2 values is:10 data length:12 max_size:20 
node:3 values is:10 data length:12 max_size:20 
node:4 values is:10 data length:12 max_size:20 
node:5 values is:10 data length:12 max_size:20 
node:6 values is:50 data length:12 max_size:20 
node:7 values is:40 data length:12 max_size:20 
node:8 values is:30 data length:12 max_size:20 
node:9 values is:20 data length:12 max_size:20 
node:10 values is:10 data length:12 max_size:20 
node:11 values is:10 data length:12 max_size:20 


上圖演示的是刪除data3的方式。插入相反

來自 “ ITPUB部落格 ” ，連結：http://blog.itpub.net/7728585/viewspace-2124937/，如需轉載，請註明出處，否則將追究法律責任。

相關文章