有一整数数组x(正序排列),判断是否有数组元素 x[i]=i 的情况发生#include int index_search(int x[],int n){int first = 0;int last = n-1;int middle,index;index = -1;while (first = 0)printf("\n\nYES,x[%d] = %d has been found.",answer,
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/12 13:41:47
![有一整数数组x(正序排列),判断是否有数组元素 x[i]=i 的情况发生#include int index_search(int x[],int n){int first = 0;int last = n-1;int middle,index;index = -1;while (first = 0)printf(](/uploads/image/z/14063610-66-0.jpg?t=%E6%9C%89%E4%B8%80%E6%95%B4%E6%95%B0%E6%95%B0%E7%BB%84x%28%E6%AD%A3%E5%BA%8F%E6%8E%92%E5%88%97%29%2C%E5%88%A4%E6%96%AD%E6%98%AF%E5%90%A6%E6%9C%89%E6%95%B0%E7%BB%84%E5%85%83%E7%B4%A0+x%5Bi%5D%3Di+%E7%9A%84%E6%83%85%E5%86%B5%E5%8F%91%E7%94%9F%23include+int+index_search%28int+x%5B%5D%2Cint+n%29%7Bint+first+%3D+0%3Bint+last+%3D+n-1%3Bint+middle%2Cindex%3Bindex+%3D+-1%3Bwhile+%28first+%3D+0%29printf%28%22%5Cn%5CnYES%2Cx%5B%25d%5D+%3D+%25d+has+been+found.%22%2Canswer%2C)
有一整数数组x(正序排列),判断是否有数组元素 x[i]=i 的情况发生#include int index_search(int x[],int n){int first = 0;int last = n-1;int middle,index;index = -1;while (first = 0)printf("\n\nYES,x[%d] = %d has been found.",answer,
有一整数数组x(正序排列),判断是否有数组元素 x[i]=i 的情况发生
#include
int index_search(int x[],int n)
{
int first = 0;
int last = n-1;
int middle,index;
index = -1;
while (first = 0)
printf("\n\nYES,x[%d] = %d has been found.",answer,answer);
else
printf("\n\nNO,there is no element with x[i] = i");
}
3应该填啥
有一整数数组x(正序排列),判断是否有数组元素 x[i]=i 的情况发生#include int index_search(int x[],int n){int first = 0;int last = n-1;int middle,index;index = -1;while (first = 0)printf("\n\nYES,x[%d] = %d has been found.",answer,
answer = index_search(x,n)
/*-------------------------------------------------------
【程序填空】
---------------------------------------------------------
功能:有一整数数组x(正序排列),判断是否有数组元素x[i]=i
的情况发生。
-----------...
全部展开
/*-------------------------------------------------------
【程序填空】
---------------------------------------------------------
功能:有一整数数组x(正序排列),判断是否有数组元素x[i]=i
的情况发生。
-------------------------------------------------------*/
#include
int index_search(int x[], int n)
{
int first = 0;
int last = n-1;
int middle, index;
index = -1;
/***********SPACE***********/
while (first<=last)
{
middle = (first + last) / 2;
/***********SPACE***********/
if (x[middle]==middle)
{
index = middle;
break;
}
/***********SPACE***********/
else if(x[middle]>middle)
last = middle - 1;
else
first = middle + 1;
}
return index;
}
#include
int main()
{
int x[] = { -1, 0, 1, 3, 5, 7, 9, 10};
int n = sizeof(x)/sizeof(int);
int answer, i;
printf("\nindex Search Program");
printf("\n====================");
printf("\n\nGiven Array :");
for (i = 0; i < n; i++)
printf("%5d", x[i]);
/***********SPACE***********/
answer=index_search(x,n);
if (answer >= 0)
printf("\n\nYES, x[%d] = %d has been found.", answer, answer);
else
printf("\n\nNO, there is no element with x[i] = i");
system ("pause");
return 0;
}
收起