And we would need, to have to look at it, and it's going to be very tricky, by the way, as to what the right answer is.

我们需要去看一看，顺便说下，正确答案可能很棘手。

麻省理工公开课 - 计算机科学及编程导论课程节选

Because this is not very tricky.

因为这个句型并不是很棘手。

What if 课堂 - SpeakingMax英语口语达人

But that merging process only takes N steps, N*log N so that's N times log of N. Now, it's a little tricky to reason through this perhaps the first time, let's just take a very simple example and see if we can do a little sanity check here.

但这个合并过程只需要N步，所以时间复杂度是,第一次对此进行推论可能会有点儿棘手，我们举一个简单的例子,看看我们能否做一些完整性的检查。

哈佛公开课 - 计算机科学课程节选