作者: admin, 讨论版: 本站建设, 发表时间: 2013-12-24 16:10:56 PST
标题: 测试贴代码片段
关键字:
int binary_search(int A[], int key, int imin, int imax)
{
// test if array is empty
if (imax < imin)
// set is empty, so return value showing not found
return KEY_NOT_FOUND;
else
{
// calculate midpoint to cut set in half
int imid = midpoint(imin, imax);
// three-way comparison
if (A[imid] > key)
// key is in lower subset
return binary_search(A, key, imin, imid-1);
else if (A[imid] < key)
// key is in upper subset
return binary_search(A, key, imid+1, imax);
else
// key has been found
return imid;
}
}
--
最后修改: admin on 2013-12-25 14:56:30 PST
※ 来源: homecox.com [来自: 66.]
|
|
|