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.

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

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

You can actually say big O of 1, big O of 1 being constant time, the same number of steps.

其复杂度为O，表示时间是一个常量，所用的步数是相同的。

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