求一段数据结构算法分析 看不懂哇int LocateElem_Sq(SqList,ElemType e,Status(*compare)(ElemType,ElemType))i=1;p=L.elem;while(i
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/11 12:16:46
![求一段数据结构算法分析 看不懂哇int LocateElem_Sq(SqList,ElemType e,Status(*compare)(ElemType,ElemType))i=1;p=L.elem;while(i](/uploads/image/z/11475786-66-6.jpg?t=%E6%B1%82%E4%B8%80%E6%AE%B5%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%AE%97%E6%B3%95%E5%88%86%E6%9E%90+%E7%9C%8B%E4%B8%8D%E6%87%82%E5%93%87int+LocateElem_Sq%28SqList%2CElemType+e%2CStatus%28%2Acompare%29%28ElemType%2CElemType%29%29i%3D1%3Bp%3DL.elem%3Bwhile%28i)
xPK`W|1Cc
1"zfmJ+?~ۖ=v=s8Tf0+sEaV;XURZIP^U:<8P
"('2SU$̆ۊi1XF5U
t1DJu^=$w|uف7Kl6ؙ2c>;hbsQbIV;!d
jE?ԆbOIaq,]ɒP-D}7y
求一段数据结构算法分析 看不懂哇int LocateElem_Sq(SqList,ElemType e,Status(*compare)(ElemType,ElemType))i=1;p=L.elem;while(i
求一段数据结构算法分析 看不懂哇
int LocateElem_Sq(SqList,ElemType e,Status(*compare)(ElemType,ElemType))
i=1;
p=L.elem;
while(i
求一段数据结构算法分析 看不懂哇int LocateElem_Sq(SqList,ElemType e,Status(*compare)(ElemType,ElemType))i=1;p=L.elem;while(i
这算法是查找线性表中是否存在e这个数.
首先把P放在头指针,即m=L.elem,然后指针移动并逐个比较,即是个循环,条件是i