C语言数据结构算法代码总结,算法及数据结构(c语言描述)期中复习代码总结.pdf...

.o

1. 规则 f1(n)+f2(n)=o(max(f1(n),f2(n))) ->顺结构if,switch结构

2. f1(n)*f2(n)=o(f1(n)*f2(n)) -> for, while, do-while结构

实(1)i=1; while(i<=n) i=i*2;}设i=i*2发频f(n),则2^f(n)<=n,,f(n)<=log2nT(n)=O(logn)

虑

6

•  CPU10

8 2

10 T(n) = 2n

8 8 2 16

•  T(n) = T(10 ) = 2×(10 ) = 2×10

16 6 10

•  2×10 /10 = 2×10

•  86,400231,480 634

. 线

• 单链进 1. 环链结针结环链结发,访问

结)clist 结clist->link 结 2. 链结

驱继,:结针储 3. 环链链头针头结,头结

头针cdlist,链结结间

顺 单链

define struct Seqlist{ struct Node;

int MAXNUM; typedef struct Node *pNode;

int n; struct Node{

DataType * element; pNode link;

}typedef struct Seqlist * PSeqlist DataType info;

}typedef struct Node *Linklist;

List PSeqlist creatNullList_seq(int m){ Linklist createNullList_link{

createNullList(void) PSeqlist palist=(PSeqlist)malloc(sizeof(struct Seqlist)); Linklist

if (palist!=NULL){ llist=(Linklist)malloc(sizeof(struct

palist->element=(DataType Node));

*)malloc(sizeof(DataType)*m);

if (llist!=NULL)llist->link=NULL;