网友您好， 请在下方输入框内输入要搜索的题目：
题目内容
（请给出正确答案）
I ( )my coat and left the house.
A.put up
B.put away
C.put up with
D.put on
参考答案
更多 “ I ( )my coat and left the house. A.put upB.put awayC.put up withD.put on ” 相关考题
考题
Using "I" or "My' instead of "most people" or "our group" ______ message credibility.A decreasesB increasesC has no effect onD distortsE A and B
考题
59 Using "I" or "My' instead of "most people" or "our group" ______ message credibility.A. decreasesB. increasesC. has no effect onD. distortsE. A and B
考题
141 Using "I" or "My' instead of "most people" or "our group" ______ message credibility.A. decreasesB. increasesC. has no effect onD. distortsE. A and B
考题
A: Would you like to come to ( )shop one day? B: Yes, I'd love to. Thank you.
A. myselfB. meC. my
考题
I, my, will, true, come, hope, dream__________________________________________________________________________.
考题
阅读下列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;}}
考题
下列程序的输出结果是【 】。 includeclass MyClass{public: int number; void set(in
下列程序的输出结果是【 】。include＜iostream. h＞class MyClass{public:int number;void set(int i);};int number=3;void MyClass: :set (int i){number=i;}void main( ){MyClass my1；int number=10;my1.set(5),cout＜＜my1, number＜＜',';my1.set(number);cout＜＜my1.number＜＜',';my1.set(: :number);cout＜＜my1.number＜＜'.';}
考题
类MyClass的定义如下： class MyClass { public： MyClass(){value=0；} SetVariable(int i){value=i；) private： int value； }； 则对下列语句序列正确的描述是( )。A．MyClass*p，my；p=my；B．语句p=my；是把对象my赋值给指针变量pC．语句MyClass*p,my；会调用两次类MyClass的构造函数D．对语句*p.SetV ariable(5)与语句my.SetVariable(5)等价
考题
设S="Myname"，可得到字符串"My"的选项是（）。A．Right(S,2)B．Left(S,2)C．Mid(S,2,2)D．Right(2,2)
热门标签
最新试卷
