lzdelphi的专栏

时间复杂度分析时间复杂度分析有下面几个原则：1）只关注循环执行次数最多的一段代码；2）加法原则：总复杂度等于量级最大的那段代码的复杂度。用公式表示即为：T1(n) = O(f(m))，T2(n) = O(g(n))，T1(n) + T2(m) = O(max(f(n), g(m)))；3）乘法原则：嵌套代码的复杂度等于嵌套内外代码复杂度的乘机。用公式表示即为：T1(n) = O(f...

#include <stdio.h>#include <stdlib.h>#include <time.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SI...

//已知线性表La和Lb中的数据元素按值非递减排列//归并La和Lb得到新的线性表Lc，Lc的数据元素也按值非递减排列void MergeList(SqList La,SqList Lb,SqList *Lc){ InitList(Lc); int alen=La.length; int blen=Lb.length; int i=1,j=1,k=0; ...

//初始条件：线性表L已存在,1<=i<=ListLength(L)//操作结果：用e改写L中第i个数据元素的值Status SetElem(SqList L,int i,ElemType e){ if(i<1 || i>ListLength(L)) return ERROR; L.elem[i-1] = e; return OK;}//...

void Union(SqList *La,SqList Lb){ int La_len = ListLength(*La); int Lb_len = ListLength(Lb); ElemType e; for(int i=1;i<=Lb_len;i++){ GetElem(Lb,i,&e); if(!Locat...

#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100#define LISTINCRE...

#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define LIST_INIT_SIZE 100#define LISTINCRE...

#include <stdio.h>#include <stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int Status;typedef int ElemType;typed...