代码搜索:姿态算法

找到约 10,000 项符合「姿态算法」的源代码

代码结果 10,000
www.eeworm.com/read/442649/7648326

txt 算法5.12.txt

int CopyGList(GList ls1, GList *ls2) { if (!ls1) *ls2 = NULL; /*复制空表*/ else { if (!(*ls2 = (Glist)malloc(sizeof(Glnode)))) return 0; /*建表结点*/ (*ls2)->tag = ls1->tag
www.eeworm.com/read/442649/7648328

txt 算法9.7.txt

【算法9.7】 typedef struct NODE{ ElemType elem; /*数据元素*/ int bf; /*平衡因子*/ struct NODE *lc,*rc; /*左右子女指针*/ }NodeType; /*结点类型*/ void R_Rotate(NodeType **p) {
www.eeworm.com/read/442649/7648331

txt 算法5.8.txt

int Create(GList *ls, char * S) { Glist p; char *sub; if StrEmpty(S) *ls = NULL; else { if (!(*ls=(GList)malloc(sizeof(GLNode)))) return 0; if (StrLength(S) = = 1) {
www.eeworm.com/read/442649/7648332

txt 算法5.9.txt

int sever(char *str, char *hstr) { int n = StrLength(str); i= 1; k = 0; for (i = 1, k = 0; i
www.eeworm.com/read/442649/7648333

txt 算法5.5.txt

MLink AddMat (Ha,Hb) MLink Ha,Hb; { Mnode *p,*q,*pa,*pb,*ca,*cb,*qa; if (Ha->row!=Hb->row || Ha->col!=Hb->col) return NULL; ca=Ha->v_next.next; /*ca初始指向A矩阵中第一行表头结点*/ cb=Hb->v_next.nex
www.eeworm.com/read/442588/7649159

pps 算法4.7.pps

www.eeworm.com/read/442588/7649160

pps 算法6.6.pps

www.eeworm.com/read/442588/7649161

pps 算法1.3.pps

www.eeworm.com/read/442588/7649162

pps 算法2.6.pps

www.eeworm.com/read/442588/7649163

pps 算法3.5.pps