It at least does corroborate the claim that merge sort N*log N as we argue intuitively is in fact, N log N in running time.

但这至少证实了归并排序,的时间复杂度为。

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

And this is now consistent with my claim that I have sorted a list of size N equals 1.

这与我之前所说的是一致的,我已经将N为1的一个序列排好了序。

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

Now, does this jive with our little asymptotic claim here, our little analysis with N notation?

那么这与用N表示法所，得出的结论是否一致呢？

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

How can one possibly claim to love rock 'n' roll, rap, country, without knowing and loving their mother, the blues?

NPR: Young People and the Future of the Blues

"The world cannot claim ignorance, " said U.N. envoy Kofi Annan.

CNN: NATO heads for Bosnia's front lines