听力原文:M: Excuse me. Are you waiting to buy tickets?
W: Yes, I am. So are all these people in front of me.
M: Have you been here long?
W: About 46 mutes. I' ve moved forward a total of about 3 feet in that time.
M: You' re kidding.
W: Not at all. There was a couple up ahead of me who got so disgusted they finally gave up and left. They said they' d been waiting for more than an hour.
M: Terrific. Does anyone know what's causing the delay?
W: If so, no one has let us know. It could be that there aren' t enough people selling tickets this afternoon. Or maybe their computer is down. I' m sure the concert hasn' t been cancelled.
M: I just hope they don' t rnn out of tickets before I get up there.
W: That really would be annoying, wouldn' t it?
M: I guess I should have come before lunch. Or has it been like this all day?
W: Apparently it has. In fact, before I came I tried calling to charge my tickets over the phone , just . to avoid this long wait. But they' re not taking phone orders, or checks, or credit cards. It's cash or nothing, and you have to come in person.
M: Well, there" re two more hours before the ticket office closes. Tickets for a good concert are worth Waiting for. So I think I'll just make myself comfortable.
What are the man and the woman doing?
A.Trying to telephone someone.
B.Attending a concert.
C.Waiting in line.
D.canceling reservations.
第2题
A.在最坏情况下时间复杂度为O(n^2)
B.在最好情况下时间复杂度为O(nlogn)
C.在平均情况下时间复杂度为O(n^2)
D.在平均情况下时间复杂度为O(nlogn)
第3题
A.计数排序的平均时间复杂度是O (n + k )
B.计数排序最好情况下的时间复杂度为O(n + k)
C.计数排序最好情况下的空间复杂度为O(n + k)
D.计数排序的复杂度为 O(n + k)
第4题
在其最好情况下的算法时间复杂度为O(n)。
A.插入排序
B.归并排序
C.快速排序
D.堆排序
第5题
最好情况下的算法时间复杂度为O(n)的是()。
A.插入排序
B.归并排序
C.快速排序
D.堆排序
为了保护您的账号安全,请在“上学吧”公众号进行验证,点击“官网服务”-“账号验证”后输入验证码“”完成验证,验证成功后方可继续查看答案!