第3题: [单项选择]假设线性表的长度为n,则在最坏情况下,冒泡排序需要的比较次数为 A. log2n B. n2 C. O(n1.5) D. n(n-1)/2 参考答案:D 答案解析:【解析】假设线性表的长度为n,则在最坏情况下,冒泡排序要经过n/2遍的从前往后的扫描和n/2遍的从后往前的扫描,需要的比较次数为n(n-1)/2。
第22题: [单项选择]It can be deduced from the passage that the author_________the practice of intelligence testing. A. disapproves of B. resents C. favors D. challenges 参考答案:C 答案解析:本题为一般推理题。结合第3段第3句、最后1句,最后1段,我们可以推知。
[难点解析]
1.About tile time that schools and others quite reasona