皮皮学，免费搜题
登录
搜题
【简答题】
以下search函数的功能是利用顺序查找法从数组a的10个元素中对关键字m进行查找。顺序查找的思路是:从第一个元素开始,从前依次与关键字比较,直到找到此元素或查找到数组尾部时结束。若找到,返回此元素的下标;若仍未找到,返回值-1。请填空。 #include int search(int a[10], int m) { int i; for(i = 0; i <= 9; i++) if (【1】) return(i); return(-1); } int main() { int a[10], m, i, no; ... no = search(【2】); if(【3】) printf(“\nOK Found!%d”, no + 1); else printf(“\nSorry Not Found!”); }
手机使用
分享
复制链接
新浪微博
分享QQ
微信扫一扫
反馈参考答案：
举一反三
【单选题】---it's raining. take an umbrella? ---All right.
A.
How about
B.
What about
C.
Why not
D.
Let’s
【单选题】It’s raining. Please take ______ orange raincoat on the desk with you when you go out.
A.
a
B.
an
C.
The
【单选题】. It isn’t raining. There’s no ________________.
A.
raining
B.
rain
C.
rains
D.
rained
【单选题】You'd better _____ outside. It's raining. [ ]
A.
go
B.
not go
C.
not going
D.
don't go
相关题目：
【单选题】---it's raining. take an umbrella? ---All right.
A.
How about
B.
What about
C.
Why not
D.
Let’s
参考解析：
知识点：
题目纠错 0
发布
