I don’t know where the key is, but I suppose I ____________it at home.A. could have leftB. should have leftC. must leave
I don’t know where the key is, but I suppose I ____________it at home.
A. could have left
B. should have left
C. must leave
相关考题：
I’ve brought two babies with me. It’s really inconvenient for me to drive to the underground parking lot.A.Don’t worry. I’ll take care of your babies while you’re driving to the underground parking lot.B.Don’t worry. Someone will drive to the underground parking lot for you with little chargeC.I’m sorry. There is no vacancy right nowD.Don’t bother about it. We provide free valet service
下列程序段实现的是顺序查找功能()intSearch(intarray[],intn,intkey){inti;array[n]=key;for(i=0;key!=array[i];i＋＋);return(in?i:－1);}。() 此题为判断题(对，错)。
–– Host: Jack, come and sit in the sofa. Dinner will be ready in a minute. Could I get you something to drink?–– Guest: ____.A: No, don ’t trouble. I ’ve drunk enoughB: No, you couldn't. I'm not thirstyC: Yes, you could. I ’d like some Coca colaD: Yes, please. I'd like some Sprite
阅读下列C程序和程序说明，将应填入(n)处的字句写在对应栏内。【说明】下面是一个用C编写的快速排序算法。为了避免最坏情况，取基准记录pivot时，采用从left、right和mid=[(left+right)/2]中取中间值，并交换到right位置的办法。数组a存放待排序的一组记录，数据类型为T，left和right是待排序子区间的最左端点和最右端点。void quicksort (int a[], int left, int right) {int temp;if (left＜right) {hat pivot = median3 (a, left, right); //三者取中子程序int i = left, j = right-1;for(;;){while (i ＜j a[i] ＜ pivot) i++;while (i ＜j pivot ＜ a[j]) j--;if(i＜j){temp = a[i]; a[j] = a[i]; a[i] = temp;i++; j--;}else break;}if (a[i] ＞ pivot){temp = a[i]; a[i] = a[right]; a[right] = temp;}quicksort( (1) ); //递归排序左子区间quieksort(a,i+1 ,right); //递归排序右子区间}}void median3 (int a[], int left, int right){ int mid=(2);int k = left;if(a[mid] ＜ a[k])k = mid;if(a[high] ＜ a[k]) k = high; //选最小记录int temp = a[k]; a[k] = a[left]; a[left] = temp; //最小者交换到 leftif(a[mid] ＜ a[right]){temp=a[mid]; a[mid]=a[right]; a[right]=temp;}}消去第二个递归调用 quicksort (a,i+1,right)。 采用循环的办法:void quicksort (int a[], int left, int right) {int temp; int i,j;(3) {int pivot = median3(a, left, right); //三者取中子程序i = left; j = righi-1;for (;; ){while (i＜j a[i] ＜ pivot)i++;while (i＜j pivot ＜a[j]) j--;if(i ＜j) {temp = a[i]; a[j]; = a[i]; a[i]=temp;i++; j--;}else break;}if(a[i]＞pivot){(4);a[i]=pivot;}quicksoft ((5)); //递归排序左子区间left = i+1;}}
____ I?know,?there?isn’t?such?a?word?in?English.A、As much asB、So far asC、As long asD、As soon as
I’dratheryou________makeanycommentontheissueforthetimebeing.A)don’tB)wouldn’tC)didn’tD)shouldn’t
-- Ann is in hospital.-- Oh, really? I __ know. I __ go and visit her.A. didn’t; am going to B. don’t; wouldC. don’t; will D. didn't; will
分析下列程序的上界O和下界W。 for （i = 1; i ＜ n; i++) key= a[i]; int j=i-1 while（j＞=0 a[j]＞key ) a[j+1]=a[j] j- - a[j+1]=key 该程序时间复杂度的上界是O（____)、下界是W（_____)。