网友您好, 请在下方输入框内输入要搜索的题目:

题目内容 (请给出正确答案)

I regret having left the work unfinished, I ____________ everything ahead carefully.

A、should plan

B、should have planned

C、planned

D、must plan


参考答案

更多 “ I regret having left the work unfinished, I ____________ everything ahead carefully.A、should planB、should have plannedC、plannedD、must plan ” 相关考题
考题 —Can I help you?—I’d like to buy a present for my mother’s birthday, () at a proper price but of great use. A、oneB、thatC、anyoneD、everything

考题 下列程序段的结果为 ______。 A= "ABBACDDCBA" For I= 6 To 2 Step-2 X=Mid(A,I,I) Y=Left(A,I) Z=Right(A,I) Z=X Y Z Next I Print ZA.ABAB.AABAABC.BBABBAD.ABBABA

考题 ( 10 )执行下列程序,显示的结果是 【 10 】 。one= "WORK"two = ""a = LEN ( one )i = aDO WHILE i=1two = two + SUBSTR ( one ,i , 1 )i=i - 1ENDDO? two

考题 I' m a deputy manager. I()an IT company.A. work forB. work aboutC. work

考题 By Saturday, I _______ here for three weeks.A:will be workingB:will have workedC:will workD:work

考题 阅读下列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;}}

考题 执行下列程序,显示的结果是【 】。ne="WORK"two=""a=LEN(one)i=aDO WHILE i>=ltwo=two+SUBSTR(one,i, 1)i=i-1ENDDO?two

考题 下列程序段的结果为A="ABBACDDCBA"For i=6 To 2 Step-2X=Mid(A,i,i)Y=Left(A,i)Z=Right(A,i)Z=XYZNextPrint ZA.ABCB.AABAABC.BBABBAD.ABBABA

考题 下列程序段的结果为_______。 A="ABBACDDCBA" For I=6 To 2 Step -2 X=Mid(A,I,I) Y=Left(A,I) Z=Right(A,I) Z=X Y Z Next I Print ZA.ABAB.AABAABC.BBABBAD.ABBABA

考题 在HTML文件中,( )标记在页面中显示work为斜体字。A.<pre>work</pre> B.<u>work</u> C.<i>work</i> D.<b>work</b>