网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
( ) you are right,( ) I am.
A. Either...or
B. Both...and
C So... that
D. Although ... yet
参考答案
更多 “ ( ) you are right,( ) I am.A. Either...orB. Both...andC So... thatD. Although ... yet ” 相关考题
考题
I’m afraid the envelopes must be delivered at once, _____ the conference brochures won’t be mailed.(A) unless(B) in case(C) otherwise(D) yet
考题
_____it was raining hard ,_____the farmers were still working.
A.Although, butB.But, althoughC.Although, yetD.Although, while
考题
--Will you go to the movie with us tonight?--I'm sorry. I have not made up my _____ yet.A. heartB. brainC. mindD. head
考题
Kathy, I’d like you to meet Maggie Jacobs.(). Maggie. You’re doing a great job.A、 I‘m pleased to meet youB、 It’s great to see you againC、 I' m happy to meet you too
考题
What can I do for you, Madam?()500yuan in cash to my son in Beijing University.A、 You’d better remitB、 I'd like to remitC、 I'd rather remit
考题
阅读下列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;}}
考题
– David, you've been losing your temper over nothing lately.– ( ).A. I haven’t been getting much sleep eitherB. You’d better not push yourself too hard, or you’ll get sickC. I’m sorry. I shouldn’t have blown up like thatD. You’d better do exercises regularly
热门标签
最新试卷
