1. n(n-1) n-1
2. n(n-1)/2 n(n-1)
选择题:
A B A
判断题
对 对
算法设计题
int Find(int A[101],int x)
{
int start = 1,end = 100,mid = 50;
while(start x)
mid = (start + mid) / 2;
else if(A[mid] < x)
mid = (mid + end) / 2;
}
return 0;
}
1. n(n-1) n-1
2. n(n-1)/2 n(n-1)
选择题:
A B A
判断题
对 对
算法设计题
int Find(int A[101],int x)
{
int start = 1,end = 100,mid = 50;
while(start x)
mid = (start + mid) / 2;
else if(A[mid] < x)
mid = (mid + end) / 2;
}
return 0;
}