【C10】
A. testified
B. claimed
C. announced
D. proclaimed
若n表示问题的规模、O(f(n))表示算法的时间复杂度随n变化的增长趋势，则算法时间复杂度最小的是(59)。
A. O(n2)
B. O(n)
C. O(log2n)
D. O(nlog2n)
Recently many schools have faced what could he called the -crisis of comprehension or, in
A. are
B. to be
C. being
D. have been
The topic (theme) of the passage mainly concerns
A. artificial language
B. natural language
C. universal language
D. sign language
微信支付 
支付宝支付